From: | Simon Riggs <simon(at)2ndQuadrant(dot)com> |
---|---|
To: | David Rowley <dgrowleyml(at)gmail(dot)com> |
Cc: | Robert Haas <robertmhaas(at)gmail(dot)com>, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, "pgsql-hackers(at)postgresql(dot)org" <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: using custom scan nodes to prototype parallel sequential scan |
Date: | 2014-11-14 00:19:04 |
Message-ID: | CA+U5nMKGMJRqX3gACqCiuY31-rDhW+RFPesubc6j9Ov5rqLhUw@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On 12 November 2014 07:54, David Rowley <dgrowleyml(at)gmail(dot)com> wrote:
> On Tue, Nov 11, 2014 at 9:29 PM, Simon Riggs <simon(at)2ndquadrant(dot)com> wrote:
>>
>>
>> This plan type is widely used in reporting queries, so will hit the
>> mainline of BI applications and many Mat View creations.
>> This will allow SELECT count(*) FROM foo to go faster also.
>>
>
> We'd also need to add some infrastructure to merge aggregate states together
> for this to work properly. This means that could also work for avg() and
> stddev etc. For max() and min() the merge functions would likely just be the
> same as the transition functions.
Do you mean something like a "subtotal" or "intermediate combination" functon?
I guess we'd need the same thing to make intermediate aggregates work
during a sort?
--
Simon Riggs http://www.2ndQuadrant.com/
PostgreSQL Development, 24x7 Support, Training & Services
From | Date | Subject | |
---|---|---|---|
Next Message | Simon Riggs | 2014-11-14 00:27:07 | Re: using custom scan nodes to prototype parallel sequential scan |
Previous Message | Simon Riggs | 2014-11-14 00:15:25 | Re: using custom scan nodes to prototype parallel sequential scan |