ANALYSIS OF PROPAGATED INFORMATION USING ANNOTATED FORESTS

摘要

Annotation information associated with entities of a computing system can be added to a forest generated from the entities where the structure of the forest reflects relationships between the entities. Annotations associated with a child node can be propagated to all parent nodes of the child node all the way up to one or more root nodes of the annotated forest. Annotations associated with a child node can be propagated to a specified depth or place or at nodes with one or more particular characteristics or annotations. The propagation can be performed on-demand to all or some subset of nodes. The annotated forest can be analyzed to determine nodes to which a set of conditions apply.

主权项

1. A system comprising:
at least one processor: a memory connected to the at least one processor: and a module that when loaded into the at least one processor causes the at least one processor to: receive an annotated forest, the annotated forest representing relationships of entities in a computing system, the annotated forest comprised of at least one parent node and at least one annotated child node, the at least one annotated child node comprising a child node of the at least one parent node, the child node associated with at least one annotation; and associate the at least one annotation to at least one immediate parent node of the at least one annotated child node; and propagate at least one annotation of an annotated child node to parent nodes of the child node until a root node of the annotated forest is reached or to a specified depth of the annotated forest or to nodes with at least one particular characteristic or to nodes with at least one particular annotation.