Re: Ordered Append Node

From: Florian Weimer <fweimer(at)bfk(dot)de>
To: Markus Schiltknecht <markus(at)bluegap(dot)ch>
Cc: Gregory Stark <stark(at)enterprisedb(dot)com>, PostgreSQL-development Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Ordered Append Node
Date: 2007-11-23 08:49:48
Message-ID: 82k5o9pcr7.fsf@mid.bfk.de
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

* Markus Schiltknecht:

>> uses a heap to efficiently find the next value from the source tapes.
>
> Well, maybe my point here is: why do you need the heap to sort?

I think you need it because there are potentially many input types.

--
Florian Weimer <fweimer(at)bfk(dot)de>
BFK edv-consulting GmbH http://www.bfk.de/
Kriegsstraße 100 tel: +49-721-96201-1
D-76133 Karlsruhe fax: +49-721-96201-99

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Markus Schiltknecht 2007-11-23 08:59:03 Re: Ordered Append Node
Previous Message Markus Schiltknecht 2007-11-23 08:08:55 Re: Ordered Append Node