System and method for intelligent state management
View Patent ↗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.
1. A method, comprising:
receiving a state request;
determining, by a processor, whether a state exists in a translation dictionary for the state request;
reproducing the state if it is not in the dictionary;
adding a new state to the dictionary; and
mapping a plurality of expressions to a plurality of descriptors, wherein one or more descriptors include one or more rules such that when a given descriptor is encountered an action occurs based on a state associated with the descriptor.
2. The method of claim 1 , further comprising:
compiling a rule, based on the state, into a given state table, wherein the rule affects data management for one or more documents that satisfy the rule.
3. The method of claim 1 , further comprising:
determining that the state represents a final state such that a descriptor is added to the state.
4. The method of claim 1 , further comprising:
determining whether the state has been referenced in an algorithm, wherein if the state is not referenced in the algorithm, then the state is released.
5. The method of claim 1 , further comprising:
determining whether the state has been referenced in an algorithm, wherein if the state is referenced in the algorithm, then the state is replaced with the new state.
6. The method of claim 1 , further comprising:
mapping a plurality of states to a plurality of descriptors such that one or more cross states are produced to minimize a number of repetitive states.
7. The method of claim 1 , further comprising:
constructing a tree that includes the state, wherein the tree is used to generate a concept based on the tree, and wherein the concept is applied to a rule that affects data management for one or more documents that satisfy the rule.
8. The method of claim 1 , further comprising:
compressing the state such that an associated descriptor includes a mode bit, an equality mode bit, a descriptor offset, and a state value.
9. Logic encoded in one or more tangible media for execution and when executed by a processor operable to:
receive a state request;
determine whether a state exists in a translation dictionary for the state request;
reproduce the state if it is not in the dictionary;
add a new state to the dictionary; and
map a plurality of expressions to a plurality of descriptors, wherein one or more descriptors include one or more rules such that when a given descriptor is encountered an action occurs based on a state associated with the descriptor.
10. The logic of claim 9 , wherein the code is further operable to:
compile a rule, based on the state, into a given state table, wherein the rule affects data management for one or more documents that satisfy the rule.
11. The logic of claim 9 , wherein the code is further operable to:
determine that the state represents a final state such that a descriptor is added to the state.
12. The logic of claim 9 , wherein the code is further operable to:
determine whether the state has been referenced in an algorithm, wherein if the state is not referenced in the algorithm, then the state is released.
13. The logic of claim 9 , wherein the code is further operable to:
determine whether the state has been referenced in an algorithm, wherein if the state is referenced in the algorithm, then the state is replaced with the new state.
14. The logic of claim 9 , wherein the code is further operable to:
map a plurality of states to a plurality of descriptors such that one or more cross states are produced to minimize a number of repetitive states.
15. The logic of claim 9 , wherein the code is further operable to:
construct a tree that includes the state, wherein the tree is used to generate a concept based on the tree, and wherein the concept is applied to a rule that affects data management for one or more documents that satisfy the rule.
16. The logic of claim 9 , wherein the code is further operable to:
compress the state such that an associated descriptor includes a mode bit, an equality mode bit, a descriptor offset, and a state value.