On Tue, Sep 13, 2011 at 5:04 PM, Peter Geoghegan <peter@2ndquadrant.com> wrote:
> On 14 September 2011 00:04, Stefan Keller <sfkeller@gmail.com> wrote:
>> Has this been verified on a recent release? I can't believe that hash
>> performs so bad over all these points. Theory tells me otherwise and
>> http://en.wikipedia.org/wiki/Hash_table seems to be a success.
My understanding is that a huge amount of work has gone into making
btree what it is in
PG, and not nearly as much work has gone into making hash indexes what
they could be.
> Hash indexes have been improved since 2005 - their performance was
> improved quite a bit in 9.0. Here's a more recent analysis:
>
> http://www.depesz.com/index.php/2010/06/28/should-you-use-hash-index/
They are 3 time faster to build. But if you rip the WAL logging out
of btree, how much faster would those get?
Also, that link doesn't address concurrency of selects at all, only of inserts.
Cheers,
Jeff