[Patch] Build the heap more efficient in tuplesort.c
От
cca5507
Тема
[Patch] Build the heap more efficient in tuplesort.c
Дата
Msg-id
tencent_FC7655A148853FB59F29013228780C075208@qq.com
Список
Дерево обсуждения
[Patch] Build the heap more efficient in tuplesort.c "cca5507" <cca5507@qq.com>
Re: [Patch] Build the heap more efficient in tuplesort.c David Rowley <dgrowleyml@gmail.com>
Re: [Patch] Build the heap more efficient in tuplesort.c "cca5507" <cca5507@qq.com>
Re: [Patch] Build the heap more efficient in tuplesort.c "cca5507" <cca5507@qq.com>
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
В списке pgsql-hackers по дате отправления
