Cache-conscious sorting of large sets of strings with dynamic tries

  title={Cache-conscious sorting of large sets of strings with dynamic tries},
  author={Ranjan Sinha and Justin Zobel},
  booktitle={ACM Journal of Experimental Algorithmics},
Ongoing changes in computer architecture are affecting the efficiency of string-sorting algorithms. The size of main memory in typical computers continues to grow but memory accesses require increasing numbers of instruction cycles, which is a problem for the most efficient of the existing string-sorting algorithms as they do not utilize cache well for large data sets. We propose a new sorting algorithm for strings, burstsort, based on dynamic construction of a compact trie in which strings are… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS


Publications citing this paper.

54 Citations

Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-8 of 8 references

Sorting strings with three - way radix quicksort

  • R. Sedgewick
  • Dr . Dobbs Journal
  • 1998
Highly Influential
6 Excerpts

Practical data structures for managing small sets of strings

  • Proceedings of Australasian Computer Science…
  • 2002
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…