Multi-mode string matching method and apparatus

Abstract

The present invention discloses a multi-mode string matching method and apparatus, in order to improve the matching efficiency and the matching speed of multi-mode string matching. In the method, mode strings with the prefix inclusion relation in the mode strings are compressed into a mode string to obtain a compressed mode set; a prefix set is constructed according to the compression mode set; and the AC automaton is constructed according to the preset algorithm. The method comprises: for each to-be-matched text string, successively inputting characters contained in the current sliding window into the AC automaton so as to obtain at least one initial matching position; for each initial matching position, if the length of the matched string of the initial matching position is less than the preset length, adding the initial matching position and the matched string into a matching result set; if the length of the matched string of the initial matching position is equal to the preset length, adding the initial matching position into a secondary matching entry set; and carrying out secondary matching for each entry position, and adding the entry position of the secondary matching and the matched string into the matching result set.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a multi-pattern character string matching method and device. Background technique [0002] In the computer field, string matching is one of the research hotspots. For example, in applications such as search operations and sensitive word filtering, string matching will be involved. A good character string matching method can help applications reduce CPU (Central Processing Unit, central processing unit) occupation time and improve application response time. [0003] Multi-pattern string matching means that there are more than one matching pattern strings. The matching method of multi-pattern strings is: there are n pattern strings P1, P2, ..., Pn and a main text string T, and n pattern strings are searched in T Whether any of them appear in T, the match is successful. In the fields of network security, information retrieval, bioinformatics and other fields, in order to realize...

AI Technical Summary

Problems solved by technology

However, when the MASN algorithm compresses the pattern set, it needs to build a prefix tree for the entire pattern set, and the compression of massive pattern strings needs to consume a lot of memory, which is likely to cause memory exhaustion and make the compression process impossible; in addition, in the matching process, it needs Traversing the entire binary search tree, when the scale of the pattern set is large, it is easy to cause the depth of the binary search tree to be large, thereby reducing the search efficiency

Images