On Optimal and Efficient in Place Merging

  • Pok-Son Kim
  • Arne Kutzner
Conference paper

DOI: 10.1007/11611257_33

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3831)
Cite this paper as:
Kim PS., Kutzner A. (2006) On Optimal and Efficient in Place Merging. In: Wiedermann J., Tel G., Pokorný J., Bieliková M., Štuller J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg

Abstract

We introduce a new stable in place merging algorithm that needs O(mlog\((\frac{n}{m}+1))\) comparisons and O(m+n) assignments. According to the lower bounds for merging our algorithm is asymptotically optimal regarding the number of comparisons as well as assignments. The stable algorithm is developed in a modular style out of an unstable kernel for which we give a definition in pseudocode.

The literature so far describes several similar algorithms but merely as sophisticated theoretical models without any reasoning about their practical value. We report specific benchmarks and show that our algorithm is for almost all input sequences faster than the efficient minimum storage algorithm by Dudzinski and Dydek. The proposed algorithm can be effectively used in practice.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Pok-Son Kim
    • 1
  • Arne Kutzner
    • 2
  1. 1.Department of MathematicsKookmin UniversitySeoulRep. of Korea
  2. 2.Department of E-BusinessSeokyeong UniversitySeoulRep. of Korea

Personalised recommendations