We study the problem of supporting queries on a string S of length n within a space bounded by the size γ of a string attractor for S. In the paper introducing string attractors it was shown that random access on S can be supported in optimal O(log(n/γ)/ log log n) time within O (γ polylog n) space. In this paper, we extend this result to rank and select queries and provide lower bounds matching our upper bounds on alphabets of polylogarithmic size. Our solutions are given in the form of a space-time trade-off that is more general than the one previously known for grammars and that improves existing bounds on LZ77-compressed text by a log log n time-factor in select queries. We also provide matching lower and upper bounds for partial sum and predecessor queries within attractor-bounded space, and extend our lower bounds to encompass navigation of dictionary-compressed tree representations.
|Data di pubblicazione:||2019|
|Titolo:||Optimal rank and select queries on dictionary-compressed text|
|Titolo del libro:||30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.4230/LIPIcs.CPM.2019.4|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|
File in questo prodotto: