Data pattern analysis using optimized deterministic finite automaton
US7991723B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 16, 2007 |
| Grant date | Aug 2, 2011 |
| Priority date | — |
| Expiry date | Dec 5, 2029 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L63/02
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques for data pattern analysis using deterministic finite automaton are described herein. In one embodiment, a number of transitions from a current node to one or more subsequent nodes representing one or more sequences of data patterns is determined, where each of the current node and subsequent nodes is associated with a deterministic finite automaton (DFA) state. A data structure is dynamically allocated for each of the subsequent nodes for storing information associated with each of the subsequent nodes, where data structures for the subsequent nodes are allocated in an array maintained by a data structure corresponding to the current node if the number of transitions is greater than a predetermined threshold. Other methods and apparatuses are also described.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.