| From: | Pavel Stehule <pavel(dot)stehule(at)gmail(dot)com> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | David Fetter <david(at)fetter(dot)org>, PostgreSQL Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: proposal: tuplestore, tuplesort aggregate functions |
| Date: | 2010-08-19 10:45:13 |
| Message-ID: | AANLkTi=FJ17paSL=azJ=DJuWBNLyppFrsjGWX77813zZ@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Hello
>
> I'll test both variant first. Maybe there are not any significant
> difference between them. Now nodeAgg can build, fill a tuplesort. So I
> think is natural use it. It needs only one - skip a calling a
> transident function and directly call final function with external
> tuplesort. Minimally you don't need 2x same code.
yesterday I did a small test. Aggregates without transident functions
are only about 2% faster, so there has no sense thinking more about
them. I'll send a patch with median and percentile functions
immediately - these functions are implemented like usual aggregates.
Regards
Pavel
>
> Regards
>
> Pavel Stehule
>
>> regards, tom lane
>>
>
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Pavel Stehule | 2010-08-19 10:59:33 | wip: functions median and percentile |
| Previous Message | Magnus Hagander | 2010-08-19 09:35:04 | Re: git: uh-oh |