So I have a quick prototype of this and in fact it handles the common use case
of a paged web page sorted on non-indexed columns very well. If you have only
a small limit like most web pages often avoids external sorts and produces
results 10-20x faster or more. Obviously by raising the size of
On Mon, 2006-09-18 at 14:26 +0100, Gregory Stark wrote:
And lastly I find the idea of putting attention into OLAP functionality
interesting. Does anyone have any ideas on where to start with that?
In SQL:2003 the OLAP functionality mostly relies on the concept of
sorted Windows over which
When we was talking about optimizing 'ORDER BY .. LIMIT' with Oleg and Alvaro at
conference, we was thinking to make new executor's node - Partial Sort. And
planner may choose which nodes to use: nodeSort and nodeLimit or nodePartialSort.
--
Teodor Sigaev
Teodor Sigaev [EMAIL PROTECTED] writes:
When we was talking about optimizing 'ORDER BY .. LIMIT' with Oleg and Alvaro
at conference, we was thinking to make new executor's node - Partial Sort. And
planner may choose which nodes to use: nodeSort and nodeLimit or
nodePartialSort.
That's an
