Invention Grant
US08560475B2 Content search mechanism that uses a deterministic finite automata (DFA) graph, a DFA state machine, and a walker process
有权
使用确定性有限自动机(DFA)图,DFA状态机和Walker进程的内容搜索机制
- Patent Title: Content search mechanism that uses a deterministic finite automata (DFA) graph, a DFA state machine, and a walker process
- Patent Title (中): 使用确定性有限自动机(DFA)图,DFA状态机和Walker进程的内容搜索机制
-
Application No.: US11224728Application Date: 2005-09-12
-
Publication No.: US08560475B2Publication Date: 2013-10-15
- Inventor: Muhammad R. Hussain , David A. Carlson , Gregg A. Bouchard , Trent Parker
- Applicant: Muhammad R. Hussain , David A. Carlson , Gregg A. Bouchard , Trent Parker
- Applicant Address: US CA San Jose
- Assignee: Cavium, Inc.
- Current Assignee: Cavium, Inc.
- Current Assignee Address: US CA San Jose
- Agency: Hamilton, Brook, Smith & Reynolds, P.C.
- Main IPC: G06F17/00
- IPC: G06F17/00

Abstract:
An improved content search mechanism uses a graph that includes intelligent nodes avoids the overhead of post processing and improves the overall performance of a content processing application. An intelligent node is similar to a node in a DFA graph but includes a command. The command in the intelligent node allows additional state for the node to be generated and checked. This additional state allows the content search mechanism to traverse the same node with two different interpretations. By generating state for the node, the graph of nodes does not become exponential. It also allows a user function to be called upon reaching a node, which can perform any desired user tasks, including modifying the input data or position.
Public/Granted literature
- US20060085533A1 Content search mechanism Public/Granted day:2006-04-20
Information query