From: | momjian(at)postgresql(dot)org (Bruce Momjian) |
---|---|
To: | pgsql-committers(at)postgresql(dot)org |
Subject: | pgsql: Done: > * -Allow ORDER BY ... |
Date: | 2007-05-05 03:14:40 |
Message-ID: | 20070505031440.DD02B9FB403@postgresql.org |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-committers |
Log Message:
-----------
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.
<
Modified Files:
--------------
pgsql/doc:
TODO (r1.2176 -> r1.2177)
(http://developer.postgresql.org/cvsweb.cgi/pgsql/doc/TODO.diff?r1=1.2176&r2=1.2177)
pgsql/doc/src/FAQ:
TODO.html (r1.677 -> r1.678)
(http://developer.postgresql.org/cvsweb.cgi/pgsql/doc/src/FAQ/TODO.html.diff?r1=1.677&r2=1.678)
From | Date | Subject | |
---|---|---|---|
Next Message | User Eggyknap | 2007-05-05 03:15:26 | pgsnmpd - pgsnmpd: Implement rdbmsRelTable |
Previous Message | User Eggyknap | 2007-05-05 03:14:33 | pgsnmpd - pgsnmpd: New Directory |