DWMH: An Improved Algorithm Based on WM for Large-Scale Pattern Set

String matching algorithm is one of the key technologies in numerous network security applications and systems. Nowadays, the increasing network bandwidth and pattern set size both call for high speed string matching algorithm for large-scale pattern set. An improved algorithm based on WM algorithm for large-scale pattern set is proposed in this paper. The presented multiple pattern string matching algorithm, DWMH, which we call in brief, combines the idea of Horspool algorithm with WM algorithm and applies the method of double hash to revise WMs HASH table to achieve better performance. Our extensive experiments demonstrated that DWMH algorithm is more efficient than WM algorithm, particularly when the size of pattern set becomes large-scale.