Character string matching method based on finite state automation and content filtering equipment
A string matching, finite state technology, applied in the field of retrieval, can solve the problem of long delay in character matching, and achieve the effect of improving processing speed and efficiency, reducing delay, and solving system performance bottlenecks
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0040] In order to solve the problem that the frequent main memory access that exists when using DFA to search the database or filter the network data stream in the prior art seriously affects the speed and efficiency of character string matching, and to reduce the time delay in the character matching process, it is necessary to reduce the character string as much as possible. The number of memory accesses during the match.
[0041] Carefully analyzing the existing DFA state table (Table 1), we can find states 2, 5, 8, 9, 10, and 11. These six states have the following two characteristics:
[0042] (1) State sequence association.
[0043] For example: state 2, 5, 8, 9, 10 and 11 in Table 1, in state 2 or 5, enter the character 'R', enter state 8; in state 8, enter the character 'Z', enter state 9 ;In state 9, enter the character 'W' to enter state 10; in state 10, enter the character 'X' to enter state 11. These six states are therefore sequentially associated.
[0044] (2)...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com