Compressed Cache-Oblivious String B-tree
From MaRDI portal
Publication:2849337
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)
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)