Re: [SQL] Which index is better for join operations

From: Vadim Mikheev <vadim(at)krs(dot)ru>
To: Chris Williams <chris_d_williams(at)itd(dot)sterling(dot)com>
Cc: pgsql-sql(at)postgreSQL(dot)org
Subject: Re: [SQL] Which index is better for join operations
Date: 1998-08-04 14:16:42
Message-ID: 35C717CA.5D1395E4@krs.ru
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-sql

Chris Williams wrote:
>
> I have a SQL statement that is SLOW and I am wondering if using a hash index instead of a btree on
> the fields that are used for the join operations would be faster? Anyone have any input on this.

No. Also, keep in mind that btree-s are more stable and hash
index creation takes more time.

Did you run vacuum? Also, it's always good to build index after
copying data to tables - it's faster and updates statistic
about relation.

> The query is between 3 tables. If you need any more details, please let me know.

Vadim

In response to

Browse pgsql-sql by date

  From Date Subject
Next Message Sergei Barbarash 1998-08-04 15:37:49 binary boolean operators
Previous Message William McCracken 1998-08-04 14:09:31 Query based on date/time field