From: Neil Conway <neilc@samurai.com>
To: Bruce Momjian <pgman@candle.pha.pa.us>
Cc: Mischa Sandberg <mischa.sandberg@telus.net>
Cc: pgsql-general@postgresql.org
Subject: Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL
Date: Wed, 11 May 2005 12:14:22 +1000
Message-ID: <42816A7E.3080508@samurai.com> (raw)
In-Reply-To: <200505110151.j4B1pnt16211@candle.pha.pa.us>
References: <200505110151.j4B1pnt16211@candle.pha.pa.us>
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
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Reply to all the recipients using the --to and --cc options:
reply via email
To: pgsql-performance@postgresql.org
Cc: neilc@samurai.com, pgman@candle.pha.pa.us, mischa.sandberg@telus.net, pgsql-general@postgresql.org
Subject: Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL
In-Reply-To: <42816A7E.3080508@samurai.com>
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox