On Sat, Aug 27, 2005 at 01:21:50AM -0500, Bruno Wolff III wrote:
> On Fri, Aug 26, 2005 at 10:59:50 -0000,
> RAJU kumar <raju_19db@rediffmail.com> wrote:
> > ?
> > ?
> > i want to find out the difference between the btree index and hash index and how exactly the hash index work.
>
> Why? You probably don't want to use hash indexes as btrees are virtually
> always better in the current implementation.
That may be true but it's still good to be able to see what they
actually do and how they work. In particular it would be good to know
what relation they have to the hash operations (HashAgg, HashJoin, etc).
--
Jim C. Nasby, Sr. Engineering Consultant jnasby@pervasive.com
Pervasive Software http://pervasive.com 512-569-9461