High Concurrence Wu-Manber Multiple Patterns Matching Algorithm

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