Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A run-time efficient realization of Aho-Corasick pattern matching machines

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Realizations of Aho-Corasick pattern matching machines which deal with several keywords at a time are studied from the viewpoint of run-time and space complexity. New realizations by means of dividing character codes and transition tables are introduced and shown to be efficient. A time-space trade-off in such realizations is pointed out. Experimental results on run-time of our realizations are shown and compared with those of some other well-known pattern matching techniques. Applications of our realizations to sorting and searching for keywords are also discussed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Knuth, D. E., Morris, J. H. and Pratt, V. R.: “Fast Pattern Matching in Strings,” TR CS-74-440 (Stanford Univ., 1974).

  2. Boyer, R. S. and Moore, J. S.: “A Fast String Searching Algorithm,” Commun. ACM,20 (1977) 762–772.

    Article  Google Scholar 

  3. Aho, A. V. and Corasick, M. J.: “Efficient String Matching,” Commun. ACM,18 (1975) 333–340.

    Article  MATH  MathSciNet  Google Scholar 

  4. Smit, G. de V.: “A Comparison of Three String Matching Algorithms,” Software-Pract. and Exper.,12 (1982) 57–66.

    Article  MATH  Google Scholar 

  5. Guibas, L. J. and Odlyzko, A. M.: “A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm,” SIAM J. Comput.,9 (1980) 672–682.

    Article  MATH  MathSciNet  Google Scholar 

  6. Rytter, W.: “A Correct Preprocessing Algorithm for Boyer-Moore String-Searching,” SIAM J. Comput.,9 (1980) 509–512.

    Article  MATH  MathSciNet  Google Scholar 

  7. Horspool, R. N.: “Practical Searching in Strings,” Software-Pract. and Exper.,10 (1980) 501–506.

    Article  Google Scholar 

  8. Arikawa, S.: “One-Way Sequential Search Systems and Their Powers,” Bull. Math. Stat.,19 (1981) 69–85.

    MATH  MathSciNet  Google Scholar 

  9. Arikawa, S., Shinohara, T., Shiraishi, S. and Tamakoshi, Y.: “SIGMA—An Information System for Researchers Use,” Bull. Informatics and Cybernetics,20 (1982) 97–114.

    Google Scholar 

  10. Aoe, J. et al.: “An Efficient Method for Storing and Retrieving Pattern Matching Machines,” Trans. Inform. Proc. Soc. of Japan,24 (1983) 414–420 [in Japanese].

    Google Scholar 

  11. Knuth, D. E.: “The Art of Computer Programming, Vol. 1, Sorting and Searching” (Addison-Wesley, 1973).

  12. Bancilhon, F. et al.: “VERSO: A Relational Backend Database Machine,” Advanced Database Machine Architecture, (ed. Hsiao, D. K.) (Prentice-Hall, 1983) 1–18.

  13. Boyer, R. S. and McCreight, E.: “Organization and Maintenance of Large Ordered Indexes,” Acta Informatica,1 (1972) 290–306.

    Article  Google Scholar 

  14. McCreight, E.: “Pagination of B*-Trees with Variable-Length Records,” Commun. ACM,20 (1977) 670–674.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute of Fundamental Information Science, Kyushu University 33, 812, Fukuoka, Japan

    Setsuo Arikawa

  2. Computer Center, Kyushu University 91, 812, Fukuoka, Japan

    Takeshi Shinohara

Authors
  1. Setsuo Arikawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takeshi Shinohara
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work was partly supported by Grant-in-Aid for Scientific Research, Ministry of Education, Science and Culture, No. 58580031 and No. 58880009.

About this article

Cite this article

Arikawa, S., Shinohara, T. A run-time efficient realization of Aho-Corasick pattern matching machines. NGCO 2, 171–186 (1984). https://doi.org/10.1007/BF03037101

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation