Re: HASH: Out of overflow pages. Out of luck

From: nconway(at)klamath(dot)dyndns(dot)org (Neil Conway)
To: selkovjr(at)xnet(dot)com
Cc: Hannu Krosing <hannu(at)tm(dot)ee>, pgsql-hackers(at)postgresql(dot)org
Subject: Re: HASH: Out of overflow pages. Out of luck
Date: 2002-08-07 14:46:58
Message-ID: 20020807144658.GA14126@klamath.dyndns.org
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Wed, Aug 07, 2002 at 12:41:04AM -0500, selkovjr(at)xnet(dot)com wrote:
> Some of the data structures resemble each other's counterparts;
> the only piece that is exactly the same as one of the five
> BerkelyDB's hash functions.

FYI, the development version of PostgreSQL uses a completely
different (and higher quality) hash function.

> The only useful experiment that I feel I am capable of making is
> trying their __ham_hash5() function, with they claim is generally
> better than the other four, for most purposes.

I'm skeptical that changing the hash function would make a significant
difference to the usability of hash indexes. At the very least, the
reproducible deadlocks under concurrent access need to be fixed, as well
as a host of other issues.

Cheers,

Neil

--
Neil Conway <neilconway(at)rogers(dot)com>
PGP Key ID: DB3C29FC

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Tatsuo Ishii 2002-08-07 15:00:53 Re: Off-topic: FUNC_MAX_ARGS benchmarks
Previous Message Lamar Owen 2002-08-07 14:43:20 Re: Open 7.3 items