Improved AC_BMH Algorithm for String Matching

Author

Meng, Qingduan ; Zhang, Xiaoling ; Lv, Dongwei

Author_Institution

Sch. of Electron. Inf. Eng., Henan Univ. of Sci. & Technol., Luoyang, China

fYear

2010

fDate

20-22 Aug. 2010

Firstpage

1

Lastpage

5

Abstract

An improved AC_BMH (Aho-Corasick_Boyer-Moore-Horspool) algorithm was proposed in this paper, which combines advantages of both double-character skip and QS (Quick Search) algorithm, and increases the jumping distance of pattern string when pattern strings matching fails, at the same time, decreases the amount of memory usage by employing compact storage mechanism. Experiment results show that the matching speed of string is improved by 22.85%-42.79% by using the proposed algorithm, and the amount of memory used reduces about 90% with many pattern strings existed.

Keywords

search problems; storage management; string matching; ACBMH Algorithm; Aho Corasick Boyer Moore Horspool algorithm; QS algorithm; compact storage mechanism; double character skip; matching speed; memory usage; pattern string matching; quick search algorithm; Algorithm design and analysis; Computers; Intrusion detection; Memory management; Pattern matching; Software; Software algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Internet Technology and Applications, 2010 International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-5142-5

Electronic_ISBN

978-1-4244-5143-2

Type

conf

DOI

10.1109/ITAPP.2010.5566604

Filename

5566604