Deterministic Finite Automata Graph Traversal with Nodal Bit Mapping
First Claim
1. A computer implemented method for generating a bit map for a deterministic finite automata based graph, the method comprising:
- analyzing valid arcs in the graph to determine a structural configuration of a current node being pointed to by a valid arc of a prior node;
constructing a respective bit map for each valid arc based on the structural configuration; and
storing the respective bit map of the current node in the valid arc of the prior node.
7 Assignments
0 Petitions
Accused Products
Abstract
An apparatus, and corresponding method, for generating a graph used in performing a search for a match of at least one expression in an input stream is presented. The graph includes a number of interconnected nodes connected solely by valid arcs. A valid arc may also include a nodal bit map including structural information of a node to which the valid arc points to. A walker process may utilize the nodal bit map to determine if a memory access is necessary. The nodal bit map reduces the number of external memory access and therefore reduces system run time.
-
Citations
42 Claims
-
1. A computer implemented method for generating a bit map for a deterministic finite automata based graph, the method comprising:
-
analyzing valid arcs in the graph to determine a structural configuration of a current node being pointed to by a valid arc of a prior node; constructing a respective bit map for each valid arc based on the structural configuration; and storing the respective bit map of the current node in the valid arc of the prior node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21)
-
-
22. A system for locating an expression in a searchable deterministic finite automata based graph, the system comprising:
-
a walker process configured traverse the searchable graph, the graph including a plurality of interconnected nodes, where at least one node includes at least one valid arc; and a bit map stored in a valid arc, associated with a prior node, the bit map providing structural information of a current node which the valid arc points to. - View Dependent Claims (23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41)
-
-
42. A computer implemented method for traversing a deterministic finite automata-based graph comprising:
-
traversing nodes in the graph, with a walker process, to search for an expression in an input stream; retrieving a valid arc associated with a current character of the input stream in a prior node; reading a respective bit map of the valid arc; determining if a next valid arc associated with a next character of the input stream exists in a current node based on a search indication provided by the reading; and accessing in memory the next valid arc associated with the next character if the search indication is positive.
-
Specification