Skip to content

P
Postgres FD Implementation
Commit 42319310 authored by Bruce Momjian's avatar Bruce Momjian
Browse files
Options

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
parent 770156e1
Hide whitespace changes
Inline Side-by-side
Showing with 10 additions and 2 deletions
doc/TODO
View file @ 42319310
......@@ -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
......
doc/src/FAQ/TODO.html
View file @ 42319310
......@@ -8,7 +8,7 @@
<body bgcolor="#FFFFFF" text="#000000" link="#FF0000" vlink="#A00000" alink="#0000FF">
<h1><a name="section_1">PostgreSQL TODO List</a></h1>
<p>Current maintainer: Bruce Momjian (<a href="mailto:pgman@candle.pha.pa.us">pgman@candle.pha.pa.us</a>)<br/>
Last updated: Fri May 27 18:01:15 EDT 2005
Last updated: Fri May 27 18:07:21 EDT 2005
</p>
<p>The most recent version of this document can be viewed at<br/>
<a href="http://www.postgresql.org/docs/faqs.TODO.html">http://www.postgresql.org/docs/faqs.TODO.html</a>.
......@@ -324,6 +324,10 @@ first.
several hash buckets could be stored on a single page and greater
granularity used for the hash algorithm.
</p>
</li><li>Consider sorting hash buckets so entries can be found using a binary
search, rather than a linear scan
</li><li>In hash indexes, consider storing the hash value with or instead
of the key itself
</li><li>Allow accurate statistics to be collected on indexes with more than
one column or expression indexes, perhaps using per-index statistics
</li><li>Add fillfactor to control reserved free space during index creation
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment