Re: WAL Bypass for indexes

Поиск
Список
Период
Сортировка
От Hannu Krosing
Тема Re: WAL Bypass for indexes
Дата
Msg-id 1144078438.3766.10.camel@localhost.localdomain
обсуждение исходный текст
Ответ на Re: WAL Bypass for indexes  (Tom Lane <tgl@sss.pgh.pa.us>)
Ответы Re: WAL Bypass for indexes  (Tom Lane <tgl@sss.pgh.pa.us>)
Список pgsql-hackers
Ühel kenal päeval, E, 2006-04-03 kell 09:55, kirjutas Tom Lane:

> (2) Some of the index code is itself deliberately nondeterministic.
> I'm thinking in particular of the move-right-or-not choice in
> _bt_insertonpg() when there are many equal keys, but randomization is
> in general a useful algorithmic technique that we'd have to forswear.

Why can't we just order "many equal keys" by ctid ? This would align the
run of equal keys with table order, likely making index scans run
faster, especially on very long equal runs.

------------
Hannu




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

Предыдущее
От: Hannu Krosing
Дата:
Сообщение: Re: WAL Bypass for indexes
Следующее
От: Tom Lane
Дата:
Сообщение: Re: WAL Bypass for indexes