External String Sorting: Faster and Cache-Oblivious

DOI10.1007/11672142_4MaRDI QIDQ5449787zbMATH OpenOpenAlexFDO

Authors Rolf Fagerberg, Anna Pagh, Rasmus Pagh

Publication date 19 March 2008

Published in STACS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11672142_4

Mathematics Subject Classification ID

Randomized algorithms (68W20) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 1559569
• A data structure for a sequence of string accesses in external memory
• Engineering External Memory Induced Suffix Sorting
• scientific article; zbMATH DE number 5499319
• Parallel External Memory Suffix Sorting

Cited in

(13)

• scientific article; zbMATH DE number 5989955 (Why is no real title available?)
• scientific article; zbMATH DE number 1559569 (Why is no real title available?)
• On demand string sorting over unbounded alphabets
• Engineering burstsort, toward fast in-place string sorting
• Optimal cache-aware suffix selection
• Fast string sorting using order-preserving compression
• Using random sampling to build approximate tries for efficient string sorting
• On Demand String Sorting over Unbounded Alphabets
• Data-specific analysis of string sorting
• Cache-efficient string sorting using copying
• Engineering parallel string sorting
• Cache-conscious sorting of large sets of strings with dynamic tries
• Remote memory references at block granularity

This page was built for publication: External String Sorting: Faster and Cache-Oblivious

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