Re: Block B-Tree concept

Поиск
Список
Период
Сортировка
От Tom Lane
Тема Re: Block B-Tree concept
Дата
Msg-id 16785.1159545459@sss.pgh.pa.us
обсуждение исходный текст
Ответ на Re: Block B-Tree concept  (Heikki Linnakangas <heikki@enterprisedb.com>)
Ответы Re: Block B-Tree concept  (Heikki Linnakangas <heikki@enterprisedb.com>)
Список pgsql-hackers
Heikki Linnakangas <heikki@enterprisedb.com> writes:
> Tom Lane wrote:
>> define "consecutive".

> I don't mean consecutive as in "1, 2, 3, 4, ... without gaps" but as in 
> "A and B are consecutive in the index, if there's no value X in the 
> index so that A < X < B". Maybe there's a better word for that.

Um, but how are you going to make that work without storing the keys for
both A and B?  You won't be able to tell whether an incoming key C
that's just a bit bigger than A should go before or after B.
        regards, tom lane


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

Предыдущее
От: Tom Lane
Дата:
Сообщение: Re: Another idea for dealing with cmin/cmax
Следующее
От: Tom Lane
Дата:
Сообщение: Array assignment behavior (was Re: [ADMIN] Stored procedure array limits)