%0 Journal Article
%T Efficient regular expression matching algorithm based on Bloom filter<br>基于Bloom filter的高效正则表达式匹配算法
%A LI Kun-peng
%A LAN Ju-long
%A LI Yin-hai
%A <br>李鲲鹏
%A 兰巨龙
%A 李印海
%J 计算机应用研究
%D 2012
%I 
%X 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.
%K regular expression
%K DFA
%K Bloom filter
%K bit vector
%K literal characters
%K matching probability
%K matching speed<br>正则表达式
%K 确定有限自动机
%K 布鲁姆过滤器
%K 比特向量
%K 确定字符串
%K 匹配概率
%K 匹配速率
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=F950C016BC33E90176419BAF285F9F81&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=38B194292C032A66&sid=114891522AE71A91&eid=F5956B5D26BCB2A8&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=15