Efficient dictionary matching by Aho-Corasick automata of truncated patterns
by Meng Zhang; Jiashu Fan; Dequan Chen
International Journal of Computing Science and Mathematics (IJCSM), Vol. 7, No. 4, 2016

Abstract: We present a space-efficient data structure for dictionary matching. We truncate patterns to truncated patterns where symbols are ℓ-length substrings of the pattern. By employing the AC automaton of truncated patterns and that of ℓ-length substrings, we simulate the AC automaton of the original pattern set. The new structure is space economical as we apply the prefix merging to substrings of patterns. Using this structure, the dictionary matching runs in O(n log k + tocc log k + occ) time where n is the length of the text, k the number of patterns, occ the number of occurrences of patterns in the text, and tocc the number of occurrences of strings that are longest prefix of each pattern with length of a multiple of ℓ.

Online publication date: Thu, 01-Sep-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com