Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL - Mailing list pgsql-general

From Neil Conway
Subject Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL
Date
Msg-id 42816A7E.3080508@samurai.com
Whole thread Raw
In response to Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL  (Bruce Momjian <pgman@candle.pha.pa.us>)
Responses Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL
List pgsql-general
Bruce Momjian wrote:
> Is there a TODO anywhere in this discussion?  If so, please let me know.

There are a couple:

- consider changing hash indexes to keep the entries in a hash bucket
sorted, to allow a binary search rather than a linear scan

- consider changing hash indexes to store each key's hash value in
addition to or instead of the key value.

You should probably include a pointer to this discussion as well.

(I'd like to take a look at implementing these if I get a chance.)

-Neil

pgsql-general by date:

Previous
From: Mischa Sandberg
Date:
Subject: Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL
Next
From: Tom Lane
Date:
Subject: Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL