Efficient regular expression matching algorithm based on Bloom filter
基于Bloom filter的高效正则表达式匹配算法

Regular expression matching technology based on DFA requires prohibitively large amounts of memory and process only one character per transition. So this paper presented an efficient regular expression matching algorithm based on Bloom filter. Literal characters of regular expression were regards as a state of DFA, and introduced bit vector to realize the matching process. Then it could process variable characters per transition based on the result of literal characters matching. The result of simulation shows the algorithm not only reduces the required memory of DFA, but also increases the matching speed.