Abstract
In the dynamic dictionary matching problem, a dictionary D contains a set of patterns that can change over time by insertion and deletion of individual patterns. The user also presents text strings and asks for all occurrences of any patterns in the text.
Amir, Farach, Galil, Giancarlo, and Park [2, 4] used an automaton based on suffix trees to solve the dynamic problem. We show how to match their time bounds for update and search using a failure function framework, similar to that used by Aho and Corasick to solve the static dictionary matching problem. We then show that our approach allows us to achieve faster search times at the expense of the update times. Finally, we show how to speed up the initial dictionary construction.
Research partially supported by the W. M. Keck Foundation
Research partially supported by NSF grant CCR-9010534.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A. V., Corasick, M. J.: Efficient String Matching: An Aid to Bibliographic Search, Comm. ACM 18 (1975), 333–340.
Amir, A., Farach, M.: Adaptive Dictionary Matching, Proc. 32nd IEEE Symp. Found. Comp. Sci., (1991), 760–766.
Amir, A., Farach, M.:, Two Dimensional Dictionary Matching, submitted for publication, 1991.
Amir, A., Farach, M., Galil, Z., Giancarlo, R., Park, K.: Dynamic Dictionary Matching, manuscript, 1991.
Amir, A., Farach, M., Idury, R. M., La Poutré, J. A., Schäffer, A. A.: Improved Dynamic Dictionary Matching, manuscript, 1992.
Amir, A., Farach, M., Matias, Y., Efficient Randomized Dictionary Algorithms, Proc. 3rd Symp. Combinatorial Pattern Matching, (1992).
Chen, M. T., Seiferas, J.: Efficient and Elegant Subword-Tree Construction, in: Apostolico A., Galil, Z. eds.: Combinatorial Algorithms on Words, NATO ASI Series, Vol. F12, (Springer-Verlag, Heidelberg, 1985), 97–107. Vol. 71 (Springer, Berlin, 1979) 118–132.
Dietz, P., Sleator, D. D.: Two Algorithms for Maintaining Order in a List, Proc. 19th ACM Symp. Theor. Comp. Sci., (1987), 365–372.
Knuth, D. E., Morris, J. H., Pratt, V. B.: Fast Pattern Matching in Strings, SIAM J. Comp. 6(1977), 323–350.
McCreight, E. M., A Space Economical Suffix Tree Construction Algorithm, J. ACM, 23(1976), 262–272.
Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching, (Springer-Verlag, Berlin), 1984.
Weiner, P.: Linear Pattern Matching Algorithms, Proc. 14th IEEE Symp. on Switching and Automata Theory, (1973), 1–11.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Idury, R.M., Schäffer, A.A. (1992). Dynamic dictionary matching with failure functions. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds) Combinatorial Pattern Matching. CPM 1992. Lecture Notes in Computer Science, vol 644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56024-6_22
Download citation
DOI: https://doi.org/10.1007/3-540-56024-6_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56024-1
Online ISBN: 978-3-540-47357-2
eBook Packages: Springer Book Archive