Home > Table of Contents


Proceedings of the 2nd International Symposium on Information Processing (ISIP 2009)

Huangshan, China, August 21-23, 2009

Editors: Fei Yu, Jian Shu, and Guangxue Yue

AP Catalog Number: AP-PROC-CS-09CN002

ISBN: 978-952-5726-02-2 (Print), 978-952-5726-03-9 (CD-ROM)

Page(s): 404-409

High Concurrence Wu-Manber Multiple Patterns Matching Algorithm

Baojun Zhang, Xiaoping Chen, Xuezeng Pan, and Zhaohui Wu

Full text: PDF


Short patterns affect the performance of Wu-Manber algorithm greatly. In order to solve this problem, an improved Wu-Manber algorithm is proposed. It divides all the patterns into different sets according to their length. For each set, independent data structures are established and different process methods are used. Because there are few resources shared among these sets, high concurrence is obtained when doing pattern matching. Experimental results demonstrate that the improved algorithm represents a high performance than the original one.

Index Terms

multiple pattern matching, hash operation, prefix, suffix, match window, block character, concurrence

Copyright @ 2009 ACADEMY PUBLISHER All rights reserved