From: | Justin Pryzby <pryzby(at)telsasoft(dot)com> |
---|---|
To: | David Rowley <dgrowleyml(at)gmail(dot)com> |
Cc: | Bruce Momjian <bruce(at)momjian(dot)us>, pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: First draft of the PG 15 release notes (sorting) |
Date: | 2022-05-11 02:38:19 |
Message-ID: | 20220511023819.GI19626@telsasoft.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Wed, May 11, 2022 at 12:39:41PM +1200, David Rowley wrote:
> I think the sort improvements done in v15 are worth a mention under
> General Performance. The commits for this were 91e9e89dc, 40af10b57
> and 697492434. I've been running a few benchmarks between v14 and v15
> over the past few days and a fairly average case speedup is about 25%.
> but there are cases where I've seen up to 400%. I think the increase
> is to an extent that we maybe should have considered making tweaks in
> cost_tuplesort(). I saw some plans that ran in about 60% of the time
> by disabling Hash Agg and allowing Sort / Group Agg to do the work.
Is there any reason not to consider it now ? Either for v15 or v15+1.
I wonder if this is also relevant.
65014000b35 Replace polyphase merge algorithm with a simple balanced k-way merge.
--
Justin
From | Date | Subject | |
---|---|---|---|
Next Message | Jonathan S. Katz | 2022-05-11 02:38:26 | Re: First draft of the PG 15 release notes |
Previous Message | osumi.takamichi@fujitsu.com | 2022-05-11 02:32:36 | RE: Data is copied twice when specifying both child and parent table in publication |