> > I very much like Hannu's idea, but it does present some issues.
> >
> >
> I too liked Hannu's idea initially, but Tom raised a valid
> concern that it does not address the basic issue of root
> tuples. According to the idea, a DEAD root tuple can be used
> for a subsequent update of the same row.
If you are reusing the existing slot of a root tuple how will that
slot likely have room for an extra pointer and a live tuple ?
If the idea does not cover root reuse we don't need pointers.
Imho we should follow the swing idea. It should even be possible
to point the root to the newest dead tuple during update (if it
was index path), and reuse an older dead slot from the chain.
Then we can limit the chain to number of potentially visible
tuples + root + 2 without vacuum.
Andreas
