On Thu, 2003-11-13 at 10:01, Tom Lane wrote:
> Mark Harrison <mh@pixar.com> writes:
> > Since these are all unique things, and will only be tested for
> > equality, I am guessing that making a hash index will be better
> > than making a btree index.
>
> You are mistaken. If there were any real value in that, we'd offer
> an easier way to do it.
>
> regards, tom lane
Hash indices also have locking restrictions that make them less useful
in most applications.
Stephen
