A Comparison on Robust Quick String and Boyer-Moore Algorithm for Network Security
String matching is one of the key algorithms in network security and numerous areas could be advantage from a quicker string matching algorithm. Based
on the most efficient string matching algorithm in regular applications, the BoyerMoore (BM) algorithm, a novel algorithm called RQS is proposed. RQS uses an enhanced terrible character heuristic to accomplish greater shift value area and an upgraded good suffix heuristic to significantly enhance the worst case performance. The two heuristics joined with a novel determinant condition to switch between them enable RQS accomplish a higher performance than BM both under normal and worst case situation. The experimental outcomes reveal that RQS seems efficient than BM many times in worst case and the greater the performance enhancement. The performance of RQS is 36.34% higher than BM in English text searching, 26.18% higher than BM in uniformly random text searching and 9.77% higher than BM the real world Snort pattern set searching.