Skip site navigation (1) Skip section navigation (2)

Re: Hash index

From: "Jim C(dot) Nasby" <jnasby(at)pervasive(dot)com>
To: Bruno Wolff III <bruno(at)wolff(dot)to>,RAJU kumar <raju_19db(at)rediffmail(dot)com>, pgsql-admin(at)postgresql(dot)org
Subject: Re: Hash index
Date: 2005-08-27 14:35:23
Message-ID: 20050827143523.GQ11282@pervasive.com (view raw or flat)
Thread:
Lists: pgsql-admin
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(at)rediffmail(dot)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(at)pervasive(dot)com
Pervasive Software        http://pervasive.com        512-569-9461

In response to

pgsql-admin by date

Next:From: Thomas E DukesDate: 2005-08-27 21:12:16
Subject: Unable to run psql
Previous:From: Bruno Wolff IIIDate: 2005-08-27 13:51:03
Subject: Re: Hash index

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group