Re: WAL Bypass for indexes

Ü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