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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Andersson, A., Nilsson, S.: Implementing radixsort. ACM Journal of Experimental Algorithmics 3 (1998) Article No. 7
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)
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)
Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. Journal of the ACM 53(6), 918–936 (2006)
McIlroy, P.M., Bostic, K., McIlroy, M.D.: Engineering radix sort. Computing Systems 6(1), 5–27 (1993)
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)
Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal on Computing 16(6), 973–989 (1987)
Puglisi, S.J., Smyth, W.F., Turpin, A.H.: A taxonomy of suffix array construction algorithms. ACM Computing Surveys 39(2) (2007)
Rahman, N., Raman, R.: Adapting radix sort to the memory hierarchy. ACM Journal of Experimental Algorithmics 6 (2001) Article No. 7
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
Sinha, R., Zobel, J., Ring, D.: Cache-efficient string sorting using copying. ACM Journal of Experimental Algorithmics 11 (2006) Article No. 1.2
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)