Index: doc/src/sgml/indices.sgml
===================================================================
RCS file: /cvsroot/pgsql/doc/src/sgml/indices.sgml,v
retrieving revision 1.31
diff -c -r1.31 indices.sgml
*** doc/src/sgml/indices.sgml 7 Jan 2002 02:29:12 -0000 1.31
--- doc/src/sgml/indices.sgml 21 Jun 2002 03:13:47 -0000
***************
*** 181,192 ****
! Because of the limited utility of hash indexes, a B-tree index
! should generally be preferred over a hash index. We do not have
! sufficient evidence that hash indexes are actually faster than
! B-trees even for = comparisons. Moreover,
! hash indexes require coarser locks; see .
--- 181,189 ----
! Testing has shown that hash indexes are slower than btree indexes,
! and the size and build time for hash indexes is much worse. For
! these reasons, hash index use is discouraged.
Index: doc/src/sgml/xindex.sgml
===================================================================
RCS file: /cvsroot/pgsql/doc/src/sgml/xindex.sgml,v
retrieving revision 1.25
diff -c -r1.25 xindex.sgml
*** doc/src/sgml/xindex.sgml 29 May 2002 17:36:40 -0000 1.25
--- doc/src/sgml/xindex.sgml 21 Jun 2002 03:13:48 -0000
***************
*** 11,19 ****
The procedures described thus far let you define new types, new
! functions, and new operators. However, we cannot yet define a secondary
! index (such as a B-tree, R-tree, or
! hash access method) over a new type or its operators.
--- 11,19 ----
The procedures described thus far let you define new types, new
! functions, and new operators. However, we cannot yet define a
! secondary index (such as a B-tree, R-tree, or hash access method)
! over a new type or its operators.
Index: doc/src/sgml/ref/create_index.sgml
===================================================================
RCS file: /cvsroot/pgsql/doc/src/sgml/ref/create_index.sgml,v
retrieving revision 1.31
diff -c -r1.31 create_index.sgml
*** doc/src/sgml/ref/create_index.sgml 18 May 2002 15:44:47 -0000 1.31
--- doc/src/sgml/ref/create_index.sgml 21 Jun 2002 03:13:48 -0000
***************
*** 329,334 ****
--- 329,339 ----
an indexed attribute is involved in a comparison using
the = operator.
+
+ Testing has shown that hash indexes are slower than btree indexes,
+ and the size and build time for hash indexes is much worse. For
+ these reasons, hash index use is discouraged.
+
Currently, only the B-tree and gist access methods support multicolumn