Request a Demo
Home   >   mailing lists

[Patch] Build the heap more efficient in tuplesort.c - Mailing list pgsql-hackers

From cca5507
Subject [Patch] Build the heap more efficient in tuplesort.c
Date
Msg-id tencent_FC7655A148853FB59F29013228780C075208@qq.com
Whole thread Raw
Responses Re: [Patch] Build the heap more efficient in tuplesort.c
List pgsql-hackers
Tree view 
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

pgsql-hackers by date:

Previous
From: "Potapov Alexander"
Date:
Subject: PG version is not seen in pg_upgrade test log
Next
From: 河田達也
Date:
Subject: Re: [PATCH] Add memory usage reporting to VACUUM VERBOSE