Compressed Cache-Oblivious String B-Tree

DOI10.1145/2903141zbMath1446.68037OpenAlexW2479292667MaRDI QIDQ4962629

Rossano Venturini, Paolo Ferragina

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

data compressionpattern matchingcompressed indexstring dictionaryindexing data structure

Mathematics Subject Classification ID

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

Related Items (2)

Adaptive learning of compressible strings ⋮ Compressed string dictionaries via data-aware subtrie compaction

This page was built for publication: Compressed Cache-Oblivious String B-Tree