> > 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 ?
In response to
pgsql-hackers by date
|Next:||From: devik||Date: 2000-09-28 12:02:35|
|Subject: Re: pgsql is 75 times faster with my new index scan|
|Previous:||From: Philip Warner||Date: 2000-09-28 09:09:45|
|Subject: pg_dump and sequences - RFC|