Compressed cache-oblivious string B-tree

DOI10.1145/2903141MaRDI QIDQ4962629zbMATH OpenOpenAlexFDO

Authors Paolo Ferragina, Rossano Venturini

Publication date 5 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

compressed indexdata compressionindexing data structurepattern matchingstring dictionary

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Recommendations

• Compressed Cache-Oblivious String B-tree
• On the weak prefix-search problem
• On the weak prefix-search problem
• Top Tree Compression of Tries.
• Top tree compression of tries

Cited in

(7)

• Adaptive learning of compressible strings
• Compressed Cache-Oblivious String B-tree
• On the weak prefix-search problem
• String Processing and Information Retrieval
• Compressed string dictionaries via data-aware subtrie compaction
• A new linear-time algorithm for centroid decomposition
• Engineering a textbook approach to index massive string dictionaries

This page was built for publication: Compressed cache-oblivious string B-tree

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