| From: | "Jonah H(dot) Harris" <jonah(dot)harris(at)gmail(dot)com> |
|---|---|
| To: | "Dann Corbit" <DCorbit(at)connx(dot)com> |
| Cc: | "Simon Riggs" <simon(at)2ndquadrant(dot)com>, "Xiao Meng" <mx(dot)cogito(at)gmail(dot)com>, pgsql-hackers(at)postgresql(dot)org, "Kenneth Marshall" <ktm(at)rice(dot)edu> |
| Subject: | Re: [PATCH]-hash index improving |
| Date: | 2008-07-18 00:40:45 |
| Message-ID: | 36e682920807171740u10ec4882u5754b3e605679224@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Thu, Jul 17, 2008 at 7:37 PM, Dann Corbit <DCorbit(at)connx(dot)com> wrote:
>> In which cases do we expect that hash indexes will beat btrees?
>
> Large table unique index equality search should be very fast with hashed
> index (and the only place where any advantage will be seen).
Yes, this is the exact use-case. Likewise, Dan has provided a good
description regarding the primary implementation goals of a disk-based
hash table.
--
Jonah H. Harris, Sr. Software Architect | phone: 732.331.1324
EnterpriseDB Corporation | fax: 732.331.1301
499 Thornall Street, 2nd Floor | jonah(dot)harris(at)enterprisedb(dot)com
Edison, NJ 08837 | http://www.enterprisedb.com/
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Sushant Sinha | 2008-07-18 01:16:24 | Re: [GENERAL] Fragments in tsearch2 headline |
| Previous Message | David Fetter | 2008-07-18 00:10:26 | Re: [PATCH]-hash index improving |