From: | "Tille, Andreas" <TilleA(at)rki(dot)de> |
---|---|
To: | |
Cc: | PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: Further open item (Was: Status of 7.2) |
Date: | 2001-11-20 10:35:33 |
Message-ID: | Pine.LNX.4.33.0111201133260.9667-100000@wr-linux02.rki.ivbb.bund.de |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Mon, 19 Nov 2001, Bruce Momjian wrote:
> > > There is not much point in arguing a specific query case,
> > It is no specific query case. It is the speed of an index scan which
> > goes like N if you do it with PostgreSQL and it goes like log N if
> > you do not have to look back into the table like MS SQL server does.
>
> Have you tried using CLUSTER to match the heap order with the index
> order. That should help with index scans looking up heap rows.
Yes, I´ve tried even that and it increase PostgreSQLs performance a little
bit for this special query but it did not get nearly the speed of the
same query on the MS SQL server. Moreover there are tables with more than
one index and I guess it makes only sense to cluster one index per table.
Kind regards
Andreas.
From | Date | Subject | |
---|---|---|---|
Next Message | Vince Vielhaber | 2001-11-20 11:42:18 | Re: The mailing list subscription page` |
Previous Message | Tatsuo Ishii | 2001-11-20 09:53:47 | Re: OCTET_LENGTH is wrong |