From: | Bruno Wolff III <bruno(at)wolff(dot)to> |
---|---|
To: | Greg Stark <gsstark(at)mit(dot)edu> |
Cc: | pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: Hash grouping, aggregates |
Date: | 2003-02-11 15:28:28 |
Message-ID: | 20030211152828.GA31840@wolff.to |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Tue, Feb 11, 2003 at 09:48:11 -0500,
Greg Stark <gsstark(at)mit(dot)edu> wrote:
>
> So one of the items on the TODO list is "Add hash for evaluating GROUP BY
> aggregates (Tom)"
>
> I'm finding this would benefit a lot of my queries. Most of the time seems to
> be going into sorts for group by clauses. I don't know how long it would take
> to build a hash of course, but I suspect it would be less than the sort.
>
> Is this something a beginner could figure out? I'm thinking I need a normal
> Hash node that builds exactly the same kind of hash as a join, then a HashScan
> node that picks all the rows out of the hash.
This is already in 7.4. You could try it out by building from CVS.
>From the HISTORY file:
System can use either hash- or sort-based strategy for grouped
aggregation
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2003-02-11 15:41:53 | Re: Hash grouping, aggregates |
Previous Message | Greg Stark | 2003-02-11 15:18:32 | Re: Hash grouping, aggregates |