Re: proposal: tuplestore, tuplesort aggregate functions - Mailing list pgsql-hackers

From Pavel Stehule
Subject Re: proposal: tuplestore, tuplesort aggregate functions
Date
Msg-id AANLkTi=FJ17paSL=azJ=DJuWBNLyppFrsjGWX77813zZ@mail.gmail.com
Whole thread Raw
In response to Re: proposal: tuplestore, tuplesort aggregate functions  (Pavel Stehule <pavel.stehule@gmail.com>)
Responses Re: proposal: tuplestore, tuplesort aggregate functions  (David Fetter <david@fetter.org>)
List 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
>>
>


pgsql-hackers by date:

Previous
From: Magnus Hagander
Date:
Subject: Re: git: uh-oh
Next
From: Pavel Stehule
Date:
Subject: wip: functions median and percentile