An Optimized External Sort Algorithm

  • Xin Zhou
  • Frank C. Lin

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.

Keywords

Memory Access File Size Memory Size Adjacent Block Disk Access 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest. “Introduction to Algorithms”. MIT Press, McGraw-Hill. (1989).Google Scholar
  3. 3.
    H. W. Six and L. Wegner. “Sorting a Random Access File in Situ”. The Computer Journal 3, p270–275 (1984).MathSciNetCrossRefGoogle Scholar
  4. 4.
    J. N. Friedman and F. Lin. “An External Sort with Limited Disk Space”. ACCESS May/June, p22-28. (1986).Google Scholar
  5. 5.
    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).MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1994

Authors and Affiliations

  • Xin Zhou
    • 1
  • Frank C. Lin
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of Maryland, Eastern ShorePrincess AnneUSA

Personalised recommendations