Burstsort : the fastest known in-memory string sorting algorithm
goanna.cs.rmit.edu.au
goanna.cs.rmit.edu.au
Then again maybe datasets of the size tested (or much bigger) are now just broken down in a map-reduce fashion over multiple machines, and then who cares about the efficiencies of cache misses etc?
Can anyone comment on if burstsort or trie based sorting algorithms in general have been adopted? (All my experience has been as a consumer of library provided "sort" methods rather than ever looking at current state of the art algorithms).