Efficient trie-based sorting of large sets of strings

Authors:
Ranjan Sinha;Justin Zobel
Affiliations:
School of Computer Science and Information Technology, RMIT University, GPO Box 2476V, Melbourne 3001, Australia;School of Computer Science and Information Technology, RMIT University, GPO Box 2476V, Melbourne 3001, Australia
Venue:
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Year:
2003

Citing 10
Cited 4

Algorithms in C

Algorithms in C
Improved behaviour of tries by adaptive branching

Information Processing Letters
Engineering a sort function

Software—Practice & Experience
Overview of the second text retrieval conference (TREC-2)

TREC-2 Proceedings of the second conference on Text retrieval conference
Splaysort: fast, versatile, practical

Software—Practice & Experience
Results and challenges in Web search evaluation

WWW '99 Proceedings of the eighth international conference on World Wide Web
Fast algorithms for sorting and searching strings

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Burst tries: a fast, efficient data structure for string keys

ACM Transactions on Information Systems (TOIS)
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)

Compression techniques for fast external sorting

The VLDB Journal — The International Journal on Very Large Data Bases
Generic discrimination: sorting and paritioning unshared data in linear time

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
An Adaptive Algorithm for Splitting Large Sets of Strings and Its Application to Efficient External Sorting

New Frontiers in Applied Data Mining
External sorting with on-the-fly compression

BNCOD'03 Proceedings of the 20th British national conference on Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sorting is a fundamental algorithmic task. Many general-purpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific kinds of data, such as strings. In previous work we have shown that our burstsort, a trie-based algorithm for sorting strings, is for large data sets more efficient than all previous algorithms for this task. In this paper we re-evaluate some of the implementation details of burstsort, in particular the method for managing buckets held at leaves. We show that better choice of data structures further improves the efficiency, at a small additional cost in memory. For sets of around 30,000,000 strings, our improved burstsort is nearly twice as fast as the previous best sorting algorithm.