Re: [HACKERS] Bizarre coding in _bt_binsrch

> The main problem is just programistic: you will have to add
> heap tid to the end of index tuples on internal index pages,
> but on leaf pages heap tid is in the begin of index tuples
> (inside of btitem struct).
>
While I absolutely like the idea of having the heap tid in the index,
I don't quite agree, that leaf pages need heap tid at the front of the key.
This would lead to Index access beeing not ordered (in terms of key) :-(

Having it in the front will only lead to "on disk ordered" fetches while
reading
tuples from one leaf page, when reading the next leaf page you will start
from the beginning.

So I think the leaf page needs heap tid at the end of each key, same as
in root pages.

For performance reasons a totally standalone "sort to tuple on disk order"
node could be implemented, that could also be handled by the
optimizer, and would be of wider performance use.

Andreas