A novel external sorting paradigm whereby disk access is minimized is presented. It is much faster (up to 10 times) than the traditional 2-way merge sort in most cases. In addition, it does not require extra space on the hard disk for temporary storage.
KeywordsMemory Access File Size Memory Size Adjacent Block Disk Access
Unable to display preview. Download preview PDF.
- 1.Paulkey Fu and Frank C. Lin. “External Sort by Block Rearrangement Algorithm”. Proc. 1 lth European Meeting on Cybernetics and Systems Research, 21–24 April p1293-1300, (1992).Google Scholar
- 2.Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest. “Introduction to Algorithms”. MIT Press, McGraw-Hill. (1989).Google Scholar
- 4.J. N. Friedman and F. Lin. “An External Sort with Limited Disk Space”. ACCESS May/June, p22-28. (1986).Google Scholar