Engineering Radix Sort for Strings

Authors:
Juha Kärkkäinen;Tommi Rantala
Affiliations:
Department of Computer Science, University of Helsinki, Finland;Department of Computer Science, University of Helsinki, Finland
Venue:
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Year:
2008

Citing 11
Cited 5

Three partition refinement algorithms

SIAM Journal on Computing
Implementing radixsort

Journal of Experimental Algorithmics (JEA)
Fast algorithms for sorting and searching strings

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Adapting Radix Sort to the Memory Hierarchy

Journal of Experimental Algorithmics (JEA)
Cache-conscious sorting of large sets of strings with dynamic tries

Journal of Experimental Algorithmics (JEA)
Cache-efficient string sorting using copying

Journal of Experimental Algorithmics (JEA)
Linear work suffix array construction

Journal of the ACM (JACM)
Cache Efficient Radix Sort for String Sorting

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A taxonomy of suffix array construction algorithms

ACM Computing Surveys (CSUR)
A new efficient radix sort

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Radix sorting with no extra space

ESA'07 Proceedings of the 15th annual European conference on Algorithms

Engineering burstsort: Toward fast in-place string sorting

Journal of Experimental Algorithmics (JEA)
Design of an efficient out-of-core read alignment algorithm

WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Medium-space algorithms for inverse BWT

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Revisiting bounded context block-sorting transformations

Software—Practice & Experience
Efficient indexing algorithms for approximate pattern matching in text

Proceedings of the Seventeenth Australasian Document Computing Symposium

Quantified Score

Hi-index	0.00

Visualization

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.