An Improved String Matching Algorithm for HTTP Data Reduction

In this paper, we analyze both BMH algorithm and QS algorithm, focus on the improvement of QS, and present FQS algorithm which can apply to HTTP data reduction. For building this algorithm, we considered character features of pattern strings in HTTP application data, improved the collating sequence of characters in matching process, and had the bad characters jumping strategy improved for increasing the jumping distance. Experimental results show that FQS algorithm effectively reduces matching time and a better time performance.