From 42319310dc8846112e19577893470fe23b82fc00 Mon Sep 17 00:00:00 2001
From: Bruce Momjian
Date: Fri, 27 May 2005 22:07:26 +0000
Subject: 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
---
doc/src/FAQ/TODO.html | 6 +++++-
1 file changed, 5 insertions(+), 1 deletion(-)
(limited to 'doc/src')
diff --git a/doc/src/FAQ/TODO.html b/doc/src/FAQ/TODO.html
index 58e35debab7..008c91f60b7 100644
--- a/doc/src/FAQ/TODO.html
+++ b/doc/src/FAQ/TODO.html
@@ -8,7 +8,7 @@
Current maintainer: Bruce Momjian (pgman@candle.pha.pa.us)
-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
--
cgit v1.2.3