Add:

> * Consider sorting hash buckets so entries can be found using a binary
>   search, rather than a linear scan
> * In hash indexes, consider storing the hash value with or instead
>   of the key itself

diff --git a/doc/TODO b/doc/TODO
index 57e0a7a186ea3fae8956d9b41d09d82078d8c62b..0220f28e5161aee2304a7a68b866cd81c0537a37 100644 (file)
--- a/doc/TODO
+++ b/doc/TODO
@@ -2,7 +2,7 @@
 PostgreSQL TODO List
 ====================
 Current maintainer:    Bruce Momjian ([email protected])
-Last updated:      Fri May 27 18:01:15 EDT 2005
+Last updated:      Fri May 27 18:07:21 EDT 2005
 
 The most recent version of this document can be viewed at
 http://www.postgresql.org/docs/faqs.TODO.html.
@@ -351,6 +351,10 @@ Indexes
   several hash buckets could be stored on a single page and greater
   granularity used for the hash algorithm.
 
+* Consider sorting hash buckets so entries can be found using a binary
+  search, rather than a linear scan
+* In hash indexes, consider storing the hash value with or instead
+  of the key itself
 * Allow accurate statistics to be collected on indexes with more than
   one column or expression indexes, perhaps using per-index statistics
 * Add fillfactor to control reserved free space during index creation

diff --git a/doc/src/FAQ/TODO.html b/doc/src/FAQ/TODO.html
index 58e35debab7e8565caaf2d6edaca694d6753dfe0..008c91f60b793b8eba6b8e9a5e2a82eee7aaba43 100644 (file)
--- a/doc/src/FAQ/TODO.html
+++ b/doc/src/FAQ/TODO.html
@@ -8,7 +8,7 @@
 
 PostgreSQL TODO List
 Current maintainer:     Bruce Momjian ([email protected])
-Last updated:           Fri May 27 18:01:15 EDT 2005
+Last updated:           Fri May 27 18:07:21 EDT 2005
 
 The most recent version of this document can be viewed at
 http://www.postgresql.org/docs/faqs.TODO.html.
@@ -324,6 +324,10 @@ first.
   several hash buckets could be stored on a single page and greater
   granularity used for the hash algorithm.
 
+  Consider sorting hash buckets so entries can be found using a binary
+  search, rather than a linear scan
+  In hash indexes, consider storing the hash value with or instead
+  of the key itself
   Allow accurate statistics to be collected on indexes with more than
   one column or expression indexes, perhaps using per-index statistics
   Add fillfactor to control reserved free space during index creation