[Patch] Build the heap more efficient in tuplesort.c

From: cca5507 <cca5507(at)qq(dot)com>
To: pgsql-hackers <pgsql-hackers(at)lists(dot)postgresql(dot)org>
Subject: [Patch] Build the heap more efficient in tuplesort.c
Date: 2025-11-30 09:35:48
Message-ID: tencent_FC7655A148853FB59F29013228780C075208@qq.com
Views: Whole Thread | Raw Message | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Hi hackers,

Now we build the heap by using tuplesort_heap_insert(), which has a sift-up every call.

To make it more efficient, I want to add tuplesort_heap_insert_unordered() and tuplesort_heap_build()
just like binaryheap_add_unordered() and binaryheap_build().

Thoughts?

--
Regards,
ChangAo Chen

Attachment Content-Type Size
v1-0001-Build-the-heap-more-efficient-in-tuplesort.c.patch application/octet-stream 7.8 KB

Browse pgsql-hackers by date

  From Date Subject
Next Message 河田達也 2025-11-30 10:43:43 Re: [PATCH] Add memory usage reporting to VACUUM VERBOSE
Previous Message Potapov Alexander 2025-11-30 09:11:44 PG version is not seen in pg_upgrade test log