作者: Zhan Peng , Yuping Wang , Jinfeng Xue
DOI: 10.1109/CIS.2014.136
关键词:
摘要: Multi-pattern matching algorithms are broadly used in many fields of computer science. However, the performance existing seriously degrades with increasing number patterns. In this paper, an improved multi-pattern algorithm based on framework Wu-Manber (WM) is proposed to effectively deal large pattern sets. The WM two aspects. Firstly, lengths lists HASH table balanced reduce candidate patterns, Secondly, a data structure called "INDEX table" binary search designed time for finding Experimental results show that our efficient large-scale