05-10-2006, 05:20 AM
Antoni and Yetifoot,
Would you guys please explain the basics of a QB implementation of how you did the merge passes.
I get a headache thinking about it. If I increase the number of files which hold sorted blocks, then I need to use more memory to be able to merge these blocks, which means I might have to decrease the block size, which means more I/O time. How do you figure out this delicate balance between memory space needed and disk I/O time?
Thanks.
*****
Would you guys please explain the basics of a QB implementation of how you did the merge passes.
I get a headache thinking about it. If I increase the number of files which hold sorted blocks, then I need to use more memory to be able to merge these blocks, which means I might have to decrease the block size, which means more I/O time. How do you figure out this delicate balance between memory space needed and disk I/O time?
Thanks.
*****