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

From: Robert Haas <robertmhaas(at)gmail(dot)com>
To: Jeremy Harris <jgh(at)wizmail(dot)org>
Cc: Pg Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Re: Using quicksort and a merge step to significantly improve on tuplesort's single run "external sort"
Date: 2015-07-31 17:31:54
Message-ID: CA+TgmoYvsRdKCusYa=empvUEy=OY=iszy8LkF6szSYTpGyhLPQ@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Fri, Jul 31, 2015 at 7:21 AM, Jeremy Harris <jgh(at)wizmail(dot)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

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Robert Haas 2015-07-31 17:35:25 Re: RequestAddinLWLocks(int n)
Previous Message Jeff Janes 2015-07-31 16:48:28 Re: LWLock deadlock and gdb advice