Thanks for your advice.
The developement of this integration is part of my final project. And fo
course my initial bibliografy includes the Knuth reference as you can see
1. Vladimir Estivill-Castro and Derick Wood. A survey of adaptive sortingalgorithms. ACM Computing Surveys,
24(4):441{476,1992.
2. Donald E. Knuth. The art of computer programming, volume 3: sorting and searching. Addison-Wesley, Reading, 2nd
edition,1998.
3. P. Larson and G. Graefe. Memory management during run generation in
external sorting. In ACM, editor, SIGMOD98, pages 472{483, 1998.
4. Per-Ake Larson. External sorting: Run formation revisited. IEEE
Transactions on Knowledge and Data Engineering, 15(4):961{972, 2003.
5. Je®rey Scott Vitter and David A. Hutchinson. Distribution sort with
randomized cycling. pages 77-86.
>
> --------------------------------------------------
> From: "Tom Lane" <tgl@sss.pgh.pa.us>
> Sent: Monday, November 26, 2007 6:00 PM
> To: "Alvaro Herrera" <alvherre@alvh.no-ip.org>
> Cc: <mac_man2005@hotmail.it>; <pgsql-hackers@postgresql.org>
> Subject: Re: [HACKERS] Replacement Selection
>
>> Alvaro Herrera <alvherre@alvh.no-ip.org> writes:
>>> mac_man2005@hotmail.it wrote:
>>>> Unfortunately I'm lost into the code... any good soul helping me to
>>>> understand what should be the precise part to be modified?
>>
>>> I think you should print the file and read it several times until you
>>> understand what's going on. Then you can start thinking where and how
>>> to modify it.
>>
>> Also, go find a copy of Knuth volume 3, because a whole lot of the
>> comments assume you've read Knuth's discussion of external sorting.
>>
>> regards, tom lane
>>
