> > Indice's TIDs are transient.
> > Isn't it useless to store indice's TIDs ?
>
> but yes Hiroshi is right. Index TID is transient. I first looked
> into pg sources two weeks ago so I have still holes in my knowledge.
> So that only solution is to traverse it ..
It was discussed several times for btree - add heap tid to index key and
you'll
scan index for particulare tuple much faster.
Not sure what could be done for hash indices... order hash items with the
same hash key?
Vadim
