Korea Advanced Institute of Science and Technology

Jong-Wook Chae

Dong-Su Han

Kyoung-Soo Park

Jae-Hyun Nam

Muhammad Jamshed

Byung-Kwon Choi

A multi-pattern matching algorithm may be provided that includes: a moving step of moving a moving window from the start of a string one byte by one byte; a DFchecking step of converting the string on a current position of the moving window into an integer value, and of checking whether or not a bit of a related position in a first direct filter DFfor patterns having lengths larger than 2 bytes is set to; a DF moving step of checking one or more direct filters DF when the bit is set toaccording to the DFchecking step; a re-moving step of moving the moving window by one byte again when the bit of a related position in the direct filter DF, which has been checked lastly, is 0; and a terminating step of checking whether the moving window is located at the end of the string or not, and of terminating the algorithm when the moving window is positioned at the end of the string.

Growing community of inventors

Daejeon, South Korea

Jong-Wook Chae