Compressed Cache-Oblivious String B-tree

DOI10.1007/978-3-642-40450-4_40MaRDI QIDQ2849337zbMATH OpenOpenAlexFDO

Authors Paolo Ferragina, Rossano Venturini

Publication date 17 September 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40450-4_40

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
• Cache-Oblivious B-Trees
• Practical compressed suffix trees
• Compressed string dictionaries via data-aware subtrie compaction
• Space-efficient construction of compressed suffix trees
• Fully compressed suffix trees
• Fully-Compressed Suffix Trees
• Compressed suffix trees, efficient computation and storage of LCP-values

Cited in

(4)

• On the weak prefix-search problem
• Compressed cache-oblivious string B-tree
• String Processing and Information Retrieval
• Space-efficient substring occurrence estimation

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 Q2849337)