open-dsi
/
postgres
mirror of https://github.com/postgres/postgres
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Done:

Browse Source 
> * -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.
<
REL8_3_STABLE
Bruce Momjian 19 years ago
parent d2a4a4069f
commit 71f8127bc6
2 changed files with 4 additions and 15 deletions
Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL
Show Stats Download Patch File Download Diff File
  1. 10
      doc/TODO
  2. 9
      doc/src/FAQ/TODO.html

10
doc/TODO
Unescape View File

@ -2,7 +2,7 @@
PostgreSQL TODO List PostgreSQL TODO List
==================== ====================
Current maintainer: Bruce Momjian (bruce@momjian.us) Current maintainer: Bruce Momjian (bruce@momjian.us)
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 The most recent version of this document can be viewed at
http://www.postgresql.org/docs/faqs.TODO.html. http://www.postgresql.org/docs/faqs.TODO.html.
@ -1361,14 +1361,8 @@ Optimizer / Executor
==================== ====================
* Improve selectivity functions for geometric operators * 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 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 * Precompile SQL functions to avoid overhead
* Create utility to compute accurate random_page_cost value * Create utility to compute accurate random_page_cost value
* Improve ability to display optimizer analysis using OPTIMIZER_DEBUG * Improve ability to display optimizer analysis using OPTIMIZER_DEBUG

9
doc/src/FAQ/TODO.html
Unescape View File

@ -8,7 +8,7 @@
<body bgcolor="#FFFFFF" text="#000000" link="#FF0000" vlink="#A00000" alink="#0000FF"> <body bgcolor="#FFFFFF" text="#000000" link="#FF0000" vlink="#A00000" alink="#0000FF">
<h1><a name="section_1">PostgreSQL TODO List</a></h1> <h1><a name="section_1">PostgreSQL TODO List</a></h1>
<p>Current maintainer: Bruce Momjian (<a href="mailto:bruce@momjian.us">bruce@momjian.us</a>)<br/> <p>Current maintainer: Bruce Momjian (<a href="mailto:bruce@momjian.us">bruce@momjian.us</a>)<br/>
Last updated: Sun Apr 29 03:17:05 EDT 2007 Last updated: Fri May 4 23:14:29 EDT 2007
</p> </p>
<p>The most recent version of this document can be viewed at<br/> <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>. <a href="http://www.postgresql.org/docs/faqs.TODO.html">http://www.postgresql.org/docs/faqs.TODO.html</a>.
@ -1210,13 +1210,8 @@ first. There is also a developer's wiki at<br/>
<ul> <ul>
<li>Improve selectivity functions for geometric operators <li>Improve selectivity functions for geometric operators
</li><li>Allow ORDER BY ... LIMIT # to select high/low value without sort or </li><li>-<em>Allow ORDER BY ... LIMIT # to select high/low value without sort or</em>
index using a sequential scan for highest/lowest values index using a sequential scan for highest/lowest values
<p> 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 &gt; 1.
</p>
</li><li>Precompile SQL functions to avoid overhead </li><li>Precompile SQL functions to avoid overhead
</li><li>Create utility to compute accurate random_page_cost value </li><li>Create utility to compute accurate random_page_cost value
</li><li>Improve ability to display optimizer analysis using OPTIMIZER_DEBUG </li><li>Improve ability to display optimizer analysis using OPTIMIZER_DEBUG

Write Preview
Loading…
Cancel
Save