Re: Re: Using quicksort and a merge step to significantly improve on tuplesort's single run "external sort"

Поиск
Список
Период
Сортировка
От Robert Haas
Тема Re: Re: Using quicksort and a merge step to significantly improve on tuplesort's single run "external sort"
Дата
Msg-id CA+TgmoYvsRdKCusYa=empvUEy=OY=iszy8LkF6szSYTpGyhLPQ@mail.gmail.com
обсуждение исходный текст
Ответ на Re: Using quicksort and a merge step to significantly improve on tuplesort's single run "external sort"  (Jeremy Harris <jgh@wizmail.org>)
Ответы Re: Re: Using quicksort and a merge step to significantly improve on tuplesort's single run "external sort"  (Jeremy Harris <jgh@wizmail.org>)
Re: Re: Using quicksort and a merge step to significantly improve on tuplesort's single run "external sort"  (Andres Freund <andres@anarazel.de>)
Список pgsql-hackers
Дерево обсуждения 
On Fri, Jul 31, 2015 at 7:21 AM, Jeremy Harris <jgh@wizmail.org> wrote:
> Heapification is O(n) already, whether siftup (existing) or down.

That's not my impression, or what Wikipedia says.  Source?

-- 
Robert Haas
EnterpriseDB: http://www.enterprisedb.com
The Enterprise PostgreSQL Company

В списке pgsql-hackers по дате отправления:

Предыдущее
От: Jeff Janes
Дата:
Сообщение: Re: LWLock deadlock and gdb advice
Следующее
От: Robert Haas
Дата:
Сообщение: Re: RequestAddinLWLocks(int n)