From 42319310dc8846112e19577893470fe23b82fc00 Mon Sep 17 00:00:00 2001 From: Bruce Momjian Date: Fri, 27 May 2005 22:07:26 +0000 Subject: [PATCH] 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/TODO | 6 +++++- doc/src/FAQ/TODO.html | 6 +++++- 2 files changed, 10 insertions(+), 2 deletions(-) diff --git a/doc/TODO b/doc/TODO index 57e0a7a186..0220f28e51 100644 --- a/doc/TODO +++ b/doc/TODO @@ -2,7 +2,7 @@ PostgreSQL TODO List ==================== 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. @@ -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 58e35debab..008c91f60b 100644 --- a/doc/src/FAQ/TODO.html +++ b/doc/src/FAQ/TODO.html @@ -8,7 +8,7 @@

PostgreSQL TODO List

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 -- 2.40.0