Done:

> * -Allow ORDER BY ... LIMIT # to select high/low value without sort or
<
<   Right now, if no index exists, ORDER BY ... LIMIT # requires we sort
<   all values to return the high/low value.  Instead The idea is to do a
<   sequential scan to find the high/low value, thus avoiding the sort.
<   MIN/MAX already does this, but not for LIMIT > 1.
<

diff --git a/doc/TODO b/doc/TODO
index d231db43f1f3bb308f1b591e5ea1815506a30d14..047d4f9c5572d3b6041fd4af707eb294fbabf8a2 100644 (file)
--- a/doc/TODO
+++ b/doc/TODO
@@ -2,7 +2,7 @@
 PostgreSQL TODO List
 ====================
 Current maintainer:    Bruce Momjian ([email protected])
-Last updated:      Sun Apr 29 03:17:05 EDT 2007
+Last updated:      Fri May  4 23:14:29 EDT 2007
 
 The most recent version of this document can be viewed at
 http://www.postgresql.org/docs/faqs.TODO.html.
@@ -1361,14 +1361,8 @@ Optimizer / Executor
 ====================
 
 * Improve selectivity functions for geometric operators
-* Allow ORDER BY ... LIMIT # to select high/low value without sort or
+* -Allow ORDER BY ... LIMIT # to select high/low value without sort or
   index using a sequential scan for highest/lowest values
-
-  Right now, if no index exists, ORDER BY ... LIMIT # requires we sort
-  all values to return the high/low value.  Instead The idea is to do a 
-  sequential scan to find the high/low value, thus avoiding the sort.
-  MIN/MAX already does this, but not for LIMIT > 1.
-
 * Precompile SQL functions to avoid overhead
 * Create utility to compute accurate random_page_cost value
 * Improve ability to display optimizer analysis using OPTIMIZER_DEBUG

diff --git a/doc/src/FAQ/TODO.html b/doc/src/FAQ/TODO.html
index 73cd36afed8c9639763ac62cf779f73ec2e45c02..80c7692eb91057de66844a8c9339c2f6642c5009 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:           Sun Apr 29 03:17:05 EDT 2007
+Last updated:           Fri May  4 23:14:29 EDT 2007
 
 The most recent version of this document can be viewed at
 http://www.postgresql.org/docs/faqs.TODO.html.
@@ -1210,13 +1210,8 @@ first.  There is also a developer's wiki at
 
 
   Improve selectivity functions for geometric operators
-  Allow ORDER BY ... LIMIT # to select high/low value without sort or
+  -Allow ORDER BY ... LIMIT # to select high/low value without sort or
   index using a sequential scan for highest/lowest values
-  Right now, if no index exists, ORDER BY ... LIMIT # requires we sort
-  all values to return the high/low value.  Instead The idea is to do a 
-  sequential scan to find the high/low value, thus avoiding the sort.
-  MIN/MAX already does this, but not for LIMIT > 1.
-
   Precompile SQL functions to avoid overhead
   Create utility to compute accurate random_page_cost value
   Improve ability to display optimizer analysis using OPTIMIZER_DEBUG