PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Paolo F., Venturini R. Compressed cache-oblivious string B-Tree. In: ACM Transactions on Algorithms (TALG), vol. 12 (4) article n. 52. ACM, 2016.
 
 
Abstract
(English)
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 + ε), for ε > 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.
URL: http://dl.acm.org/citation.cfm?id=2903141
DOI: 10.1145/2903141
Subject Compression
Indexing
H.3.3 INFORMATION STORAGE AND RETRIEVAL. Information Search and Retrieval


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional