Improved AC_BMH Algorithm for String Matching

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.