System and Method for Intelligent State Management
9 Assignments
0 Petitions
Accused Products
Abstract
A method is provided in one example embodiment and it includes receiving a state request and determining whether a state exists in a translation dictionary for the state request. The method further includes reproducing the state if it is not in the dictionary and adding a new state to the dictionary. In more specific embodiments, the method includes compiling a rule, based on the state, into a given state table. The rule affects data management for one or more documents that satisfy the rule. In yet other embodiments, the method includes determining that the state represents a final state such that a descriptor is added to the state. In one example, if the state is not referenced in the algorithm, then the state is released. If the state is referenced in the algorithm, then the state is replaced with the new state.
19 Citations
49 Claims
-
1-29. -29. (canceled)
-
30. At least one machine readable medium that includes code for execution and when executed, causes at least one processor to:
receive one or more documents and a state request that includes a state, wherein the state in compressed notation is organized into an ordered set with one or more Boolean qualifiers for a bisection lookup, and wherein one or more of the Boolean qualifiers identify whether an element is evaluated using a qualification. - View Dependent Claims (31, 32, 33, 34, 35, 36, 37, 38, 39, 40)
-
41. A method, comprising:
receiving one or more documents and a state request that includes a state, wherein the state in compressed notation is organized into an ordered set with one or more Boolean qualifiers for a bisection lookup, and wherein one or more of the Boolean qualifiers identify whether an element is evaluated using a qualification. - View Dependent Claims (42, 43, 44, 45, 46, 47)
-
48. An apparatus, comprising:
-
a memory element coupled to at least one processor; and a flow processing module including a set of executable instructions stored in the memory element, wherein the executable instructions, when executed by the at least one processor, are to; receive one or more documents and a state request that includes a state, wherein the state in compressed notation is organized into an ordered set with one or more Boolean qualifiers for a bisection lookup, and wherein one or more of the Boolean qualifiers identify whether an element is evaluated using a qualification. - View Dependent Claims (49)
-
Specification