Re: B-tree performance improvements in 8.x

Поиск
Список
Период
Сортировка
От Tom Lane
Тема Re: B-tree performance improvements in 8.x
Дата
Msg-id 903.1139350409@sss.pgh.pa.us
обсуждение исходный текст
Ответ на Re: B-tree performance improvements in 8.x  (jao@geophile.com)
Ответы Re: B-tree performance improvements in 8.x  (Dick Kniep <dick@kniep.nl>)
Список pgsql-general
jao@geophile.com writes:
> Quoting Tom Lane <tgl@sss.pgh.pa.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

В списке pgsql-general по дате отправления:

Предыдущее
От: Tom Lane
Дата:
Сообщение: Re: Why pg_hba not in table?
Следующее
От: Dick Kniep
Дата:
Сообщение: Re: B-tree performance improvements in 8.x