Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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).
Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest. “Introduction to Algorithms”. MIT Press, McGraw-Hill. (1989).
H. W. Six and L. Wegner. “Sorting a Random Access File in Situ”. The Computer Journal 3, p270–275 (1984).
J. N. Friedman and F. Lin. “An External Sort with Limited Disk Space”. ACCESS May/June, p22-28. (1986).
Dalia Motzkin and Cristina L. Hansen. “An Efficient External Sorting with Minimal Space Requirement”. International Journal of Computer and Information Sciences Vol.11, No. 6, P381. (1982).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zhou, X., Lin, F.C. (1994). An Optimized External Sort Algorithm. In: Baeza-Yates, R. (eds) Computer Science 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-9805-0_11
Download citation
DOI: https://doi.org/10.1007/978-1-4757-9805-0_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-9807-4
Online ISBN: 978-1-4757-9805-0
eBook Packages: Springer Book Archive