The weak-prefix search problem asks for the strings in a dictionary that are prefixed by a pattern P[1,p], if any, otherwise it admits any answer. Strings in have average length ℓ, are n in number, and are given in advance to be preprocessed, whereas pattern P is provided on-line. In this paper we solve this problem in the cache-oblivious model by using the optimal O(n log ℓ) bits of space and O(p/B + log B n) I/Os. The searching algorithm is of Monte-Carlo type, so its answer is correct with high probability. We also extend our algorithmic scheme to the case in which a probability distribution over the queried prefixes is known, and eventually address the deterministic case too. © 2011 Springer-Verlag.
CITATION STYLE
Ferragina, P. (2011). On the weak prefix-search problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6661 LNCS, pp. 261–272). https://doi.org/10.1007/978-3-642-21458-5_23
Mendeley helps you to discover research relevant for your work.