On the weak prefix-search problem

Citations of this article
Mendeley users who have this article in their library.


The weak-prefix search problem consists of searching for the strings in a dictionary S that are prefixed by a pattern P[1,p]; if no such string does occur, any answer can be returned. Strings in S have average length ℓ, are n in number, and are given in advance to be preprocessed, whereas the pattern P is provided on-line. In this paper we solve this problem in the external-memory and in the cache-oblivious models by using the optimal O(nlogℓ) bits of space and requiring 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 discuss some variants of the problem concerning with a distribution over the queried patterns, a deterministic solution, and foresee applications in the design of energy-efficient data structures. © 2012 Elsevier B.V. All rights reserved.




Ferragina, P. (2013). On the weak prefix-search problem. In Theoretical Computer Science (Vol. 483, pp. 75–84). https://doi.org/10.1016/j.tcs.2012.06.011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free