Re: B-tree performance improvements in 8.x

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: jao(at)geophile(dot)com
Cc: pgsql-general(at)postgresql(dot)org
Subject: Re: B-tree performance improvements in 8.x
Date: 2006-02-07 22:13:29
Message-ID: 903.1139350409@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

jao(at)geophile(dot)com writes:
> Quoting Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>:
>> In 8.0, the descent code can do
>> either "first entry >= X" or "first entry > X", and the positioning
>> rules never need to step more than one entry to locate the desired
>> starting position (details left as exercise for the reader).

> What about a compound index (x, y), in which there are many y values
> for a given x? My query is "... WHERE x = ? and y = ?".

Doesn't really matter whether the key is simple or compound --- all
that matters is whether you have multiple entries that are "equal" to
the boundary value.

regards, tom lane

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Michael Glaesemann 2006-02-07 22:54:10 Re: UNION or OR / INTERSECT or AND ?
Previous Message Tom Lane 2006-02-07 21:55:55 Re: Why pg_hba not in table?