摘要 |
Rules are arranged as nodes among layers of a hierarchical decision tree. Nodes of the decision tree can be copied and re-used at other locations on the current tree, or on another tree, in a highly efficient manner. When this occurs, corresponding field values from a parent or ancestor node are automatically updated in the newly introduced node. In addition, when a decision tree is used to operate on an event repository, the results of various rules, defined as a “match” or “no match”, are stored in a common event table that is accessible by nodes at other layers of the decision tree. In addition, actions can be initiated, for example command scripts, at designated nodes of the decision tree, for example upon the occurrence of certain conditions.
|