Research Of Compound Rule Set Matching Method Based On The Regular Expression

With the complexity of the Internet,some traditional matching methods have been unable to meet the requirements of the logical meaning of the keywords in the network data stream.At the same time,with the expansion of the Internet content,the demand for a large number of data fast matching becomes stronger.So this research is based on the actual matching of network,and we submit the compound rule set matching method based on the "partial" logical relationship.We use the method of regular expression,to logically descript and match the network data,and achieve the balance between the logical expression and fast matching finally.The main research contents include:1 Analysis of the logical characteristics of the keywords in the current network data,and submit the compound matching method based on the "partial" logical relationship to match the network data;2 By the method of using "chain" regular expression to construct the "state machine",we complete the overall structure of the compound rules matching.So task of compound rule set matching is turned to the task of state transition in the "state machine".At the same time,by the design of the "semi-DFA" and the "mixed state automation",we make the balance between the space construction and the matching speed in the whole process;3 According to the characteristics of the "state machine",by the method of reducing the character set,we make the optimization to the whole matching function entity.It reduced the construction cost and the subsequent state jump number,and finally it improved the overall matching speed;...