| From: | Richard Guo <guofenglinux(at)gmail(dot)com> |
|---|---|
| To: | Robert Haas <robertmhaas(at)gmail(dot)com> |
| Cc: | Andrei Lepikhov <lepihov(at)gmail(dot)com>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Consider explicit incremental sort for Append and MergeAppend |
| Date: | 2025-07-07 07:37:54 |
| Message-ID: | CAMbWs4-LmpsEZK6hp7Y2p5SAs=kFxghqDwrQs=VG3Jf0a-+Q5w@mail.gmail.com |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Thu, May 22, 2025 at 6:07 PM Richard Guo <guofenglinux(at)gmail(dot)com> wrote:
> So, I think it's generally safe to use incremental sort whenever
> possible. There might be some corner cases where incremental sort is
> slower than full sort, and I think it would be best to address those
> in nodeIncrementalSort.c, as Robert suggested.
Here's the latest rebase. I'm planning to push it soon, barring any
objections.
Thanks
Richard
| Attachment | Content-Type | Size |
|---|---|---|
| v2-0001-Consider-explicit-incremental-sort-for-Append-and.patch | application/octet-stream | 15.9 KB |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Dean Rasheed | 2025-07-07 07:53:46 | Re: array_random |
| Previous Message | Dean Rasheed | 2025-07-07 07:29:52 | Re: Binary operators for cubes |