Re: How Postgresql Compares For Query And Load Operations

From: Mark kirkwood <markir(at)slingshot(dot)co(dot)nz>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
Cc: pgsql-general(at)postgresql(dot)org
Subject: Re: How Postgresql Compares For Query And Load Operations
Date: 2001-07-19 11:01:17
Message-ID: 01071923011701.02409@spikey.slithery.org
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

On Saturday 14 July 2001 02:49, Tom Lane wrote:

> >
> > It would seem that Oracle's execution plan is more optimal.
>
> Hmm, since I don't know the details of Oracle's plan displays, it's hard
> to comment on that --- but it looks to me like the plans are essentially
> the same, with the small difference that Postgres chooses to use the
> index on dim0 to filter ....(snipped )

After a little thinking, I am inclined to agree with you Tom... I wondered if
the difference might to be due to pure sequential scan performance
differences. I tried this query :

SELECT sum(val) FROM fact0

for Postgres, Db2 and Oracle. The results were

Postgres 2m25s
Db2 40s
Oracle 50s

This seems to be the likely culprit. I suspect that the "many block/page read
at once" type optimzations (prefetch for Db2 and mutli block read for Oracle)
mean that table sequential scans are faster for these guys than Postgres.

Thus on the bright side their access plans are not necessarily any better
than Postgres !

regards

Mark

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message DaVinci 2001-07-19 11:04:03 Re: list all indices
Previous Message Tomaz Borstnar 2001-07-19 10:53:08 Re: VACUUM ANALYZE