Skip to main content
Springer Nature Link
Log in

Engineering Radix Sort for Strings

  • Conference paper
String Processing and Information Retrieval (SPIRE 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5280))

Included in the following conference series:

Abstract

We describe new implementations of MSD radix sort for efficiently sorting large collections of strings. Our implementations are significantly faster than previous MSD radix sort implementations, and in fact faster than any other string sorting algorithm on several data sets. We also describe a new variant that achieves high space-efficiency at a small additional cost on runtime.

Supported in part by Academy of Finland grant 118653 (ALGODAN).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Andersson, A., Nilsson, S.: A new efficient radix sort. In: Proc. 35th IEEE Symposium on the Foundations of Computer Science, pp. 714–721. IEEE Computer Society, Los Alamitos (1994)

    Chapter  Google Scholar 

  2. Andersson, A., Nilsson, S.: Implementing radixsort. ACM Journal of Experimental Algorithmics 3 (1998) Article No. 7

    Google Scholar 

  3. Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, pp. 360–369. SIAM, Philadelphia (1997)

    Google Scholar 

  4. Franceschini, G., Muthukrishnan, S., Patrascu, M.: Radix sorting with no extra space. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 194–205. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. Journal of the ACM 53(6), 918–936 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. McIlroy, P.M., Bostic, K., McIlroy, M.D.: Engineering radix sort. Computing Systems 6(1), 5–27 (1993)

    Google Scholar 

  7. Ng, W., Kakehi, K.: Cache efficient radix sort for string sorting. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E90-A(2), 457–466 (2007)

    Article  Google Scholar 

  8. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal on Computing 16(6), 973–989 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  9. Puglisi, S.J., Smyth, W.F., Turpin, A.H.: A taxonomy of suffix array construction algorithms. ACM Computing Surveys 39(2) (2007)

    Google Scholar 

  10. Rahman, N., Raman, R.: Adapting radix sort to the memory hierarchy. ACM Journal of Experimental Algorithmics 6 (2001) Article No. 7

    Google Scholar 

  11. Sinha, R., Zobel, J.: Cache-conscious sorting of large sets of strings with dynamic tries. ACM Journal of Experimental Algorithmics 9 (2004) Article No. 1.5

    Google Scholar 

  12. Sinha, R., Zobel, J., Ring, D.: Cache-efficient string sorting using copying. ACM Journal of Experimental Algorithmics 11 (2006) Article No. 1.2

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Helsinki, Finland

    Juha Kärkkäinen & Tommi Rantala

Authors
  1. Juha Kärkkäinen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tommi Rantala
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Bar-Ilan University, 52900, Ramat-Gan, Israel

    Amihood Amir

  2. School of Computer Science and Information Technology, RMIT University, Melbourne, Australia

    Andrew Turpin

  3. NICTA Victoria Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Victoria, Australia

    Alistair Moffat

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kärkkäinen, J., Rantala, T. (2008). Engineering Radix Sort for Strings. In: Amir, A., Turpin, A., Moffat, A. (eds) String Processing and Information Retrieval. SPIRE 2008. Lecture Notes in Computer Science, vol 5280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89097-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89097-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89096-6

  • Online ISBN: 978-3-540-89097-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics