Abstract
The availability of large main memories and the new technologies for disk drives have modified the models for external sorting and have renewed interest in their study. We investigate the replacement-selection paradigm for external sorting. We focus on the performance of the merge phase when given random files and specially when given nearly sorted files since such files are common in practice. In particular, we demonstrate that, during the merge phase, the floating-buffers technique not only reduces the sorting time by fully overlapping I/O and saving seeks, but also it profits significantly from existing order in the input. We also propose a new algorithm for computing a feasible reading sequence for floating buffers that improves upon previous algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
