From: | Thomas Munro <thomas(dot)munro(at)gmail(dot)com> |
---|---|
To: | Peter Geoghegan <pg(at)bowt(dot)ie> |
Cc: | pgsql-hackers <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: Optimising compactify_tuples() |
Date: | 2020-08-19 23:27:28 |
Message-ID: | CA+hUKGJ1h+po0srBrzeb4dg1QOd_QRRtwNqwzMtk5QpNww_MjQ@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Wed, Aug 19, 2020 at 11:41 PM Thomas Munro <thomas(dot)munro(at)gmail(dot)com> wrote:
> On Tue, Aug 18, 2020 at 6:53 AM Peter Geoghegan <pg(at)bowt(dot)ie> wrote:
> > I definitely think that we should have something like this, though.
> > It's a relatively easy win. There are plenty of workloads that spend
> > lots of time on pruning.
>
> Alright then, here's an attempt to flesh the idea out a bit more, and
> replace the three other copies of qsort() while I'm at it.
I fixed up the copyright messages, and removed some stray bits of
build scripting relating to the Perl-generated file. Added to
commitfest.
Attachment | Content-Type | Size |
---|---|---|
v2-0001-Add-sort_template.h-for-making-fast-sort-function.patch | text/x-patch | 13.9 KB |
v2-0002-Use-sort_template.h-for-compactify_tuples.patch | text/x-patch | 1.7 KB |
v2-0003-Use-sort_template.h-for-qsort-and-qsort_arg.patch | text/x-patch | 13.9 KB |
v2-0004-Use-sort_template.h-for-qsort_tuple-and-qsort_ssu.patch | text/x-patch | 12.2 KB |
From | Date | Subject | |
---|---|---|---|
Next Message | David Rowley | 2020-08-19 23:33:34 | Re: [PG13] Planning (time + buffers) data structure in explain plan (format text) |
Previous Message | Alvaro Herrera | 2020-08-19 22:58:11 | Re: Hybrid Hash/Nested Loop joins and caching results from subplans |