Skip to main content
SpringerLink
Log in

Efficient text searching of regular expressions

Preliminary version

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 372))

Included in the following conference series:

Abstract

We present algorithms for efficient searching of regular expressions on preprocessed text. We obtain logarithmic (in the size of the text) average time for a wide subclass of regular expressions, and sublinear average time for any regular expression, hence providing the first known algorithm to achieve this time complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aho and M. Corasick. Efficient string matching: An aid to bibliographic search. C.ACM, 18(6):333–340, June 1975.

    Article  Google Scholar 

  2. A. Aho. Pattern Matching in Strings, pages 325–347. Academic Press, London, 1980.

    Google Scholar 

  3. R. Boyer and S. Moore. A fast string searching algorithm. C.ACM, 20:762–772, 1977.

    Article  Google Scholar 

  4. B. Commentz-Walter. A string matching algorithm fast on the average. In ICALP, volume 6 of Lecture Notes in Computer Science xxx, pages 118–132. Springer-Verlag, 1979.

    Google Scholar 

  5. L. Devroye. A note on the average depth of tries. Computing, 28:367–371, 1982.

    Google Scholar 

  6. M. Fischer and M. Paterson. String Matching and Other Products, volume 7, pages 113–125. American Mathematical Society, Providence, RI, 1974.

    Google Scholar 

  7. P. Flajolet and C. Puech. Tree structures for partial match retrieval. J.ACM, 33:371–407, 1986.

    Article  Google Scholar 

  8. Z. Galil. Open Problems in Stringology, volume F12 of NATO ASI Series, pages 1–8. Springer-Verlag, 1985.

    Google Scholar 

  9. F.R. Gantmacher. The Theory of Matrices (2 Vols). Chelsea Publishing Company, New York, 1959.

    Google Scholar 

  10. G.H. Gonnet. Unstructured data bases or very efficient text searching. In ACM PODS, volume 2, pages 117–124, Atlanta, GA, Mar 1983.

    Google Scholar 

  11. J. Hopcroft and J. Ullman. Introduction to Automata Theory. Addison-Wesley, Reading, Mass., 1979.

    Google Scholar 

  12. D. Knuth, J. Morris, and V. Pratt. Fast pattern matching in strings. SIAM J on Computing, 6:323–350, 1977.

    Article  Google Scholar 

  13. D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, Mass., 1973.

    Google Scholar 

  14. D. Morrison. Patricia-practical algorithm to retrieve information coded in alphanumeric. JACM, 15:514–534, 1968.

    Article  Google Scholar 

  15. A.M. Ostrowski and H. Schneider. Bounds for the maximal characteristic root of a non-negative irreducible matrix. Duke Math J., 27:547–553, 1960.

    Article  Google Scholar 

  16. R. Pinter. Efficient String Matching with Don't-Care Patterns, volume F12 of NATO ASI Series, pages 11–29. Springer-Verlag, 1985.

    Google Scholar 

  17. R. Rivest. On the worst-case behavior of string-searching algorithms. SIAM J on Computing, 6:669–674, 1977.

    Article  Google Scholar 

  18. K. Thompson. Regular expression search algorithm. C.ACM, 11:419–422, 1968.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for the New O.E.D. & Data Structuring Group Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Ricardo A. Baeza-Yates & Gaston H. Gonnet

Authors
  1. Ricardo A. Baeza-Yates
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gaston H. Gonnet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simonetta Ronchi Della Rocca

Rights and permissions

Reprints 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: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035751

Download citation

  • DOI: https://doi.org/10.1007/BFb0035751

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51371-1

  • Online ISBN: 978-3-540-46201-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation