On Thu, 2004-04-29 at 13:13, Manfred Koizar wrote:
> On Wed, 28 Apr 2004 08:23:35 -0400, Rod Taylor <pg@rbt.ca> wrote:
> >The below plpgsql forces the kind of algorithm we wish the planner could
> >choose. It should be fairly quick irregardless of dataset.
>
> That reminds me of hash aggregation. So here's another idea for Vitaly:
The reason for the function is that the sort routines (hash aggregation
included) will not stop in mid-sort, although I believe that feature is
on the TODO list.
I believe Vitaly will achieve 10ms or less query times using that
function.
