| 摘要 |
Key performance indicator (KPI) expressions are rewritten using metric hierarchies. A node label is associated with each node in the metric hierarchies, the metric hierarchies arranged in arbitrary trees. Node labels associated with each term in a KPI expression are retrieved, and the terms in the KPI expression are sorted according to the node labels. The terms are grouped according to the node labels, and a collection of groups that covers all the terms in the KPI expression is found. Overlaps in the covering groups may be minimized.
|
