Patent Document ID: 7991723
Application ID: 11778546
Patent Flag: 1

Claim One:
1. A computer-implemented method to optimize data pattern analysis, comprising: determining a number of possible transitions from a current node to one or more subsequent nodes representing one or more sequences of data patterns, each of the current node and subsequent nodes being associated with a deterministic finite automaton (DFA) state; dynamically allocating a data structure for each of the subsequent nodes for storing information associated with each of the subsequent nodes, wherein data structures for the subsequent nodes are allocated in a logical array maintained by a data structure corresponding to the current node if the number of possible transitions is greater than a predetermined threshold to improve performance; and determining whether each of the subsequent nodes includes a single child node, wherein the data structures for the subsequent nodes are allocated in an array maintained by a data structure corresponding to the current node if each of the subsequent nodes includes a single child node.