Abstract
We present algorithms for efficient searching of regular expressions on preprocessed text, using a Patricia tree as index. We obtain searching algorithms with logarithmic expected time in the size of the text for a wide subclass of regular expressions, and sublinear expected time for any regular expression. These are the first known algorithms to achieve these time complexities.
Similar content being viewed by others
References
R.A. Baeza-Yates. Efficient Text Searching. PhD thesis, Dept. of Computer Science, University of Waterloo, May 1989. Also as Research Report CS-89-17.
R. Baeza-Yates and G.H. Gonnet. Efficient text searching of regular expressions. In ICALP'89, Stresa, Italy, July 1989. Also as UW Centre for the New OED Report, OED-89-01, Univ. of Waterloo, April, 1989.
R.A. Baeza-Yates and G.H. Gonnet. Solving matrix recurrences with applications. Technical Report CS-89-16, Department of Computer Science, University of Waterloo, May 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baeza-Yates, R.A., Gonnet, G.H. (1989). Efficient text searching of regular expressions. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_1
Download citation
DOI: https://doi.org/10.1007/3-540-51542-9_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51542-5
Online ISBN: 978-3-540-48237-6
eBook Packages: Springer Book Archive