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

From Robert Haas
Subject Re: Re: Using quicksort and a merge step to significantly improve on tuplesort's single run "external sort"
Date
Msg-id CA+TgmoYvsRdKCusYa=empvUEy=OY=iszy8LkF6szSYTpGyhLPQ@mail.gmail.com
Whole thread Raw
In response to Re: Using quicksort and a merge step to significantly improve on tuplesort's single run "external sort"  (Jeremy Harris <jgh@wizmail.org>)
Responses Re: Re: Using quicksort and a merge step to significantly improve on tuplesort's single run "external sort"
Re: Re: Using quicksort and a merge step to significantly improve on tuplesort's single run "external sort"
List 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 by date:

Previous
From: Jeff Janes
Date:
Subject: Re: LWLock deadlock and gdb advice
Next
From: Robert Haas
Date:
Subject: Re: RequestAddinLWLocks(int n)