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

DOI10.1145/1005813.1041517MaRDI QIDQ5463449zbMATH OpenOpenAlexWikidataFDO

Authors Ranjan Sinha, Justin Zobel

Publication date 4 August 2005

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1005813.1041517

zbMATH Keywords

string-sorting algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Cache-efficient string sorting using copying
• Using random sampling to build approximate tries for efficient string sorting
• Engineering burstsort, toward fast in-place string sorting
• External String Sorting: Faster and Cache-Oblivious
• Faster suffix sorting

Cited in

(6)

• scientific article; zbMATH DE number 5989955 (Why is no real title available?)
• Engineering burstsort, toward fast in-place string sorting
• Using random sampling to build approximate tries for efficient string sorting
• Cache-efficient string sorting using copying
• Engineering parallel string sorting
• Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing

This page was built for publication: Cache-conscious sorting of large sets of strings with dynamic tries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463449)