View Single Post

   
  #9 (permalink)  
Old 04-15-2008, 10:34 PM
Florian Weimer
 
Posts: n/a
Default Re: Ordered Append Node

* 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@bfk.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

---------------------------(end of broadcast)---------------------------
TIP 5: don't forget to increase your free space map settings

Reply With Quote