Method for accelerating character string matching by trans-border protection mechanism

Abstract

The invention provides a method which uses a boundary violation protection mechanism for accelerating the matching of character strings. A tail position of a text is obtained according to the length of the text to be matched, and the last end character of the text is assumed to be positioned at the position of loc; an isolation word of one character is arranged in the position of loc plus 1, and the isolation word is any character that does not appear in a mode; a copy mode is connected to the position of loc plus 2 of the text; a normal character string matching is implemented without checking whether a subscript crosses a boundary; whether a subscript crosses the boundary or not is judged in front of the matching position of an output mode, if the subscript does not cross the boundary, the matching position is output, and if the subscript crosses the boundary, the matching action is then finished. The method of the invention has no relation with the concrete realization of the matching of the character strings and is a general improved method for present matching problems of various character strings. The output action after the mode matching in the whole string matching process is the action with the lowest frequency of all the actions appearing in the string matching process. Therefore, the method of the invention can minimize the total number of the examination operations for the subscript boundary violation.

Description

(1) Technical field [0001] The invention relates to an information processing method, in particular to a character string matching method used in the field of information processing. (2) Background technology [0002] String matching can be understood as finding one or several patterns with certain properties from a given sequence of symbols. The application range of string matching is extremely wide. Almost all applications involving text processing will involve string matching operations. This problem is the core problem in important fields such as network security, information retrieval, and computational biology. At present, with the emergence of network security issues and the emergence of applications such as super-large databases, high-speed search engines, and the Human Genome Project, there is a strong demand for high-speed matching algorithms. [0003] String matching can be classified based on whether the text to be processed was known at the time of the matching...

AI Technical Summary

Problems solved by technology

[0006] The above method is known as the simple out-of-boundary protection method, which does not minimize the number of out-of-boundary protection checks

At the same time, this method can only be applied to the tuned BM algorithm. Other algorithms cannot be applied to other algorithms because they do not have the characteristic that the jump distance is 0 when the character to be read matches the last character of the pattern.

Images