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

  • Authors:

  • Ranjan Sinha;Justin Zobel

  • Affiliations:

  • RMIT University, Melbourne, Australia;RMIT University, Melbourne, Australia

  • Venue:
  • Journal of Experimental Algorithmics (JEA)
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 kept in buckets. It is simple, fast, and efficient. We experimentally explore key implementation options and compare burstsort to existing string-sorting algorithms on large and small sets of strings with a range of characteristics. These experiments show that, for large sets of strings, burstsort is almost twice as fast as any previous algorithm, primarily due to a lower rate of cache miss.