> > question is whether we need it for hash indices. it is definitely
> > good for btree as they support range retrieval. hash ind. doesn't
> > it so I wouldn't implement it for them.
>
> We need in fast heap tuple --> index tuple lookup for overwriting
> storage manager anyway...
oh .. there will be such one ?
