Re: performance in selecting from very large recordset

From: Bruno Wolff III <bruno(at)wolff(dot)to>
To: Dann Corbit <DCorbit(at)connx(dot)com>
Cc: Hijax <hijax_pl(at)wp(dot)pl>, pgsql-general(at)postgresql(dot)org
Subject: Re: performance in selecting from very large recordset
Date: 2003-12-19 21:33:46
Message-ID: 20031219213346.GC14968@wolff.to
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

On Fri, Dec 19, 2003 at 12:54:35 -0800,
Dann Corbit <DCorbit(at)connx(dot)com> wrote:
>
> There were problems with hashed indexes in PostgreSQL before. I think
> that they have all been addressed in 7.4, but I am not an expert on
> their usage in that environment, so it would be good if others can
> supply feedback. I develop database systems under many environments,
> and so my advice is not PG specific.

While some bugs with hashed indexes were fixed, as far as I know they
still aren't faster than btree indexes for anything. So that you would
want to use btree indexes in preference to hash indexes.

In response to

Browse pgsql-general by date

  From Date Subject
Next Message Joshua D. Drake 2003-12-19 21:36:41 Re: PostgreSQL speakers needed for OSCON 2004
Previous Message Bruno Wolff III 2003-12-19 21:07:24 Re: Tables referencing each other