| 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 11:41:41 |
| Message-ID: | CA+hUKG+hAgRaV-+r0bY6Hc7nETCVQ7kuBhjFc1J-FjPAtChjbQ@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
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.
| Attachment | Content-Type | Size |
|---|---|---|
| 0001-Add-sort_template.h-for-making-fast-sort-functions.patch | text/x-patch | 13.7 KB |
| 0002-Use-sort_template.h-for-compactify_tuples.patch | text/x-patch | 1.7 KB |
| 0003-Use-sort_template.h-for-qsort-and-qsort_arg.patch | text/x-patch | 13.9 KB |
| 0004-Use-sort_template.h-for-qsort_tuple-and-qsort_ssup.patch | text/x-patch | 9.8 KB |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Ashutosh Sharma | 2020-08-19 11:45:06 | Re: recovering from "found xmin ... from before relfrozenxid ..." |
| Previous Message | David Rowley | 2020-08-19 11:24:37 | Re: [PG13] Planning (time + buffers) data structure in explain plan (format text) |