A Time-and Space-Efficient Multi-pattern Matching Algorithm

In the intrusion detection systems, pattern matching algorithm has been the focus of this system. After studying various algorithms in this field, the paper presents a time-and space- efficient multi-pattern matching algorithm. The algorithm uses the bitmap to store the states which could compress the space, in the matching process the algorithm do not need to compare every character individually, it could skip characters as possible as we can according to the needs. It is a very time-saving algorithm. The thoughts of compression storage and jumping characters in the algorithm can reduce the hardware memory access times, so that the algorithm can more easily adapt to the hardware implementation.