Evaluation of High-performance Regular Expression Matching Algorithms
Jin Jun-hang · Jisuanji gongcheng · 2010
In order to analyze and evaluate the existed regular expression matching algorithms,it implements them such as DFA,D2FA,CD2FA,mDFA and XFA,and conducts extensive experiments on short rules to evaluate the performance of these algorithms.Experimental results show that compared with mDFA,XFA achieves 84.9%~89.9% memory reduction;XFA only increases 38.9%~174.6% matching times in comparison with mDFA;when the number of rules increases by 8 times,mDFA increases 64 times memory space,while XFA only increases 16 times memory space and increases 61.3% matching time,which demonstrates that XFA has good scalability in terms of memory requirements and matching efficiency.