aboutsummaryrefslogtreecommitdiff
path: root/doc/TODO
diff options
context:
space:
mode:
Diffstat (limited to 'doc/TODO')
-rw-r--r--doc/TODO7
1 files changed, 4 insertions, 3 deletions
diff --git a/doc/TODO b/doc/TODO
index 76213752d34..e43185fb32d 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: Mon Apr 25 09:03:30 EDT 2005
+Last updated: Mon Apr 25 11:35:24 EDT 2005
The most recent version of this document can be viewed at
http://www.postgresql.org/docs/faqs.TODO.html.
@@ -862,12 +862,13 @@ Optimizer / Executor
====================
* Add missing optimizer selectivities for date, r-tree, etc
-* Allow ORDER BY ... LIMIT 1 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 1 requires we sort
+ 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