On Thu, Jul 17, 2008 at 7:37 PM, Dann Corbit <[EMAIL PROTECTED]> 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 | [EMAIL PROTECTED] Edison, NJ 08837 | http://www.enterprisedb.com/ -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers