Patent ID: 7634500
Filing Date: 2009-12-15
Classification: G06F,G11C,Y10S

Abstract:
1. A method, comprising: receiving a text string having a plurality of characters; and performing an unanchored search of a database of a stored patterns matching one or more characters of the text string using a state machine, wherein the state machine comprises a ternary content addressable memory (TCAM) and wherein the performing comprises comparing a state of the state machine and one of the plurality of characters with contents of a state field and a character field, respectively, stored in the TCAM, wherein the contents of the state field and the character field stored in the TCAM embody state transitions of the state machine, wherein the performing further comprises: converging all branches of the state machine, for a given stored pattern, to a single next state when a first number of the characters are matched to the contents of a state field of all state transitions of the branches, wherein the single next state is an earlier possible next state for at least one of the branches and wherein the converging comprises transitioning at least one of the branches to the earlier possible next state.