| 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 09:30:08 |
| Message-ID: | 823auxpavz.fsf@mid.bfk.de |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
* Markus Schiltknecht:
>> You need a priority queue to figure out from which tape (partition)
>> you need to remove the next tuple.
>
> And why do you need lots of heap memory to do that? Anything wrong
> with the zipper approach I've outlined upthread?
"heap" == "priority queue" here, I guess. Looking at your zipper
again, it's actually an implementation of a heap.
--
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
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Markus Schiltknecht | 2007-11-23 09:33:20 | Re: Ordered Append Node |
| Previous Message | Heikki Linnakangas | 2007-11-23 09:28:34 | Re: Ordered Append Node |