> > 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 ?
- Re: [HACKERS] pgsql is 75 times faste... Bruce Momjian
- RE: [HACKERS] pgsql is 75 times faster with my new index sc... Mikheev, Vadim
- RE: [HACKERS] pgsql is 75 times faster with my new index sc... Mikheev, Vadim
- RE: [HACKERS] pgsql is 75 times faster with my new index sc... Mikheev, Vadim
- RE: [HACKERS] pgsql is 75 times faster with my new index sc... Mikheev, Vadim
- RE: [HACKERS] pgsql is 75 times faster with my new index sc... Mikheev, Vadim
- devik