A Pattern Matching Method Based on Search Engine Retrieving Information

Abstract

The invention discloses a pattern matching method based on searching information retrieved by a search engine. The BF improved algorithm is adopted, that is, characters or character strings are first extracted from a pattern string to be matched to form a new pattern string, and the new pattern string is compared with the pattern string to be matched. Record the number of characters in the interval between these characters or character strings, form an object with the number of characters that make up the new pattern string and the number of characters in the character interval, and then use the characters in the new pattern string and the characters at the corresponding positions of the target string to perform multiple Round comparison, first compare the even index in the object until the new pattern string completely matches the character at the corresponding position in the target string, then compare the odd index in the object until the pattern string to be matched is found in the target string. By optimizing the comparison structure and comparison order of the pattern string, each round of matching does not need to compare the first character of the pattern string with the corresponding character in the target string one by one, which can reduce the number of comparisons and improve the efficiency of pattern matching.

Description

technical field [0001] The invention relates to the field of pattern matching, in particular to an improved BF algorithm based on search engine retrieval information pattern matching. Background technique [0002] With the rapid development of computer network technology, the amount of information generated every moment is growing explosively, including unstructured data such as text, pictures, audio, video, and geographic location. Computer networks have brought convenience and speed to people, but they are also overwhelmed by these massive data information. The disorderly, huge information world and various link methods make people feel at a loss when looking for the information they need. The amount of data information is so large and mostly in unstructured data format, which puts forward higher requirements for search engines to retrieve information. It no longer just helps people retrieve more information from massive data, but more quickly It is more efficient and ac...

AI Technical Summary

Problems solved by technology

[0020] As can be seen from the above-mentioned BF traditional algorithm flow, each match starts from the first character of the pattern string and matches character by character backward. After one match is completed, the pattern string is moved backward by one character distance relative to the target string Continue to match one by one. In the whole process, once a certain character fails to match, it will start from the beginning, that is, start from the last character of the target string to match the character of the pattern string again, so as to mechanically repeat the matching one by one. This leads to a large number of comparisons and low matching efficiency

Images