On Mon, 8 Sep 2003 11:31:05 +0200, "Zeugswetter Andreas SB SD"
>> As Tom mentioned, we might not want to keep the tid's in order after the
>> index is created because he wants the most recent tid's first, so the
>> expired ones migrate to the end.
>But on average this argument only holds true for unique indexes, no ?
>Is there any code that stops the heap lookup after the visible tuple is found ?
>At least in an index with more rows per key you will fetch all heaps after the 
>first one anyway to get at the next row. This is better done in heap order, no ?

Yes, yes, yes, and yes.  Seems we all agree on that; the patch has
been queued for 7.5.


---------------------------(end of broadcast)---------------------------
TIP 4: Don't 'kill -9' the postmaster

Reply via email to