Paralleling multiple-mode matching method and system of matching regulation including choosing character

Abstract

The invention relates to a system and a method for parallel multiple patterns matching with matching rules containing selectable characters. The system comprises a matching automaton generation module and a matching execution module, wherein the matching automaton generation module is used for reading an original matching rule set, each selectable mode, which corresponds to the selectable characters, of original matching rules containing the selectable characters in the original matching rule set is generated into a new matching rule, determined original matching rules which do not contain the selectable characters are taken as new matching rules corresponding to the original matching rules which do not contain the selectable characters, and all the new matching rules are generated into an AC automaton according to an AC algorithm; and the matching execution module is used for reading a search object, the AC automaton is applied to the matching search according to the AC algorithm, whether the search object is matched with one new matching rule is judged, the matching is successful if the search object is matched with one new matching rule, and the original matching rule corresponding to the matched new matching rule is output. The system and the method can use the AC algorithm to perform the matching to the matching rules containing the selectable characters.

Description

technical field [0001] The invention belongs to the technical field of text or network content processing, and in particular relates to a parallel multi-pattern matching method and system in which matching rules include optional characters. Background technique [0002] Multiple Pattern String Matching (Multiple Pattern String Matching) is one of the basic problems in the field of computer science, which is used to quickly judge whether a certain data block contains one or some rules in the rule set. Multi-pattern matching technology is widely used in text processing, network content analysis, intrusion detection, bioinformatics, information retrieval and other fields. [0003] One of the classic methods to solve parallel multi-pattern matching problems is based on finite state automata. The method was first proposed by Alfred V.Aho and Margaret J.Corasick in 1975, and is usually abbreviated as the AC multi-pattern matching algorithm after the inventor's name. The outstand...

AI Technical Summary

Problems solved by technology

[0005] For the pattern matching of various deterministic rules, the AC algorithm (and its variants) is undoubtedly a very good algorithm, but it cannot handle the matching of non-deterministic rules containing wildcards.

However, if the matching rule is a non-deterministic rule containing optional characters, that is, it is more flexible to indicate that there are several optional characters at a certain position in the matching rule, such as "334566[abx]dw4" (the optional characters The indicator [abx] indicates that any one of the characters 'a', 'b' or 'x' can be followed by "334566", followed by "dw4"), then the AC algorithm cannot be directly processed

Images