Compressed Cache-Oblivious String B-Tree

Ferragina P., Venturini R.

Indexing data structure  H.3 INFORMATION STORAGE AND RETRIEVAL  Data compression  Mathematics (miscellaneous)  Compressed index  Pattern matching  String dictionary  Indexing 

In this article, we study three variants of the well-known prefix-search problem for strings, and we design solutions for the cache-oblivious model which improve the best known results. Among these contributions, we close (asymptotically) the classic problem, which asks for the detection of the set of strings that share the longest common prefix with a queried pattern by providing an I/O-optimal solution that matches the space lower bound for tries up to a constant multiplicative factor of the form (1 + epsilon), for epsilon > 0. Our solutions hinge upon a novel compressed storage scheme that adds the ability to decompress prefixes of the stored strings I/O-optimally to the elegant locality-preserving front coding (Bender et al. 2006) still preserving its space bounds.

Source: ACM transactions on algorithms 12 (2016). doi:10.1145/2903141

Publisher: Association for Computing Machinery,, New York, NY , Stati Uniti d'America

Metrics