We are working on speeding up the queries by creating indexes. We have
queries with searching criteria such as "select ... where *col1='...'*".
This is a simple query with only "=" operation. As a result I setup hash
index on column "col1". While, in postgreSQL 8 doc, it is wirttern:
*Note: * Testing has shown PostgreSQL's hash indexes to perform no
better than B-tree indexes, and the index size and build time for hash
indexes is much worse. For these reasons, hash index use is presently
May I know for simple "=" operation query, for "Hash index" vs. "B-tree"
index, which can provide better performance please?
pgsql-performance by date
|Next:||From: Neil Conway||Date: 2005-05-09 14:36:42|
|Subject: Re: "Hash index" vs. "b-tree index" (PostgreSQL 8.0)|
|Previous:||From: Harald Fuchs||Date: 2005-05-09 11:39:30|
|Subject: Re: Query tuning help|
pgsql-general by date
|Next:||From: Tom Lane||Date: 2005-05-09 13:47:14|
|Subject: Re: = or := ? |
|Previous:||From: John D. Burger||Date: 2005-05-09 13:04:49|
|Subject: Re: Shorthand for foreign key indices|