# US 2008/0288529 A1 · System to organize data for visualizing performance characteristics in dynamic perspectives using relational database

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0288529 A1
- Document ID: US20080288529A1
- Status: Published application
- Kind: A1
- Application number: 11/869,959
- Filed: 2007-10-10
- Published: 2008-11-20
- Earliest claimed: 2006-10-10
- Assignees: International Business Machines Corporation
- Inventors: Long Cheng; Yi Fei Fang; Liang Qi; Yi Zhen Xu; Pu Yang
- Web page: https://patentgrep.com/patent/US20080288529A1

## CPC

- G06F 16/284: {Relational databases}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Techniques for reconstructing a target hierarchy tree structure from profiling data of a computer system according to a predefined relational model, so as to obtain profiling information of a certain selected node. The predefined relational model is defined in advance according to a hierarchy tree structure of the profiling data, and is stored in an external storage system. The hierarchy tree structures can be constructed dynamically as required, thus the occupied amount of a memory can be seduced and users can view the profiling data freely.

## Claims

### Claim 1

A method for dynamically constructing a target hierarchy tree structure from profiling data of a computer system according to a predefined relational model so as to obtain profiling information of a certain selected node, wherein said predefined relational model is defined according to profiling objects of said profiling data and includes profiling information of each of nodes in the hierarchy tree structure, said method comprising steps of:
(a) determining entities at each level in a path from a root node to said selected node in said target hierarchy tree structure according to said predefined relational model and definition of said target hierarchy tree structure, so as to obtain an entity array;
(b) obtaining identification information of all the nodes including said selected node in each path from the root node to the selected node in said target hierarchy tree structure according to said entity array, so as to obtain one or more corresponding identification arrays;
(c) selecting from said predefined relational model all the rows having corresponding values of said identification array(s) in those columns representing corresponding entities according to said obtained entity array and identification array(s), so as to determine a row set;
(d) for all the rows of said row set, grouping together those rows having the same identification information in those columns in said predefined relational model, which represent entities of nodes at the next level to said selected node in said target hierarchy tree structure, according to the entity type of said nodes at the next level, so that said row set is divided into one or more groups;
(e) for all the rows of each of said groups in said predefined relational model, aggregating profiling information contained in each row, so as to obtain aggregate profiling information of each group; and
(f) processing the obtained aggregate profiling information of each group to obtain the profiling information of said node in said target hierarchy tree structure.

### Claim 2 (depends on 1)

The method of claim 1, wherein one path from the root node to each leaf node in the hierarchy tree structure of the profiling data is represented as one row in said predefined relational model, and each row in said predefined relational model further comprises profiling information of the corresponding leaf node in the hierarchy tree structure of said profiling data.

### Claim 3 (depends on 2)

The method of claim 2, wherein said profiling information contains at least used processor time information in the computer system.

### Claim 4 (depends on 3)

The method of claim 3, wherein said step (e) further comprises a step of summing up the used processor time contained in each row of each determined group in said predefined relational model so that a total used processor time of each group is obtained.

### Claim 5 (depends on 1)

The method of claim 1, further comprising a step of:
repeatedly performing steps (a)-(f) for all the nodes beginning with the root node in said target hierarchy tree structure, so that the profiling information of all the nodes in said target hierarchy tree structure can be obtained.

### Claim 6 (depends on 1)

The method of claim 1, wherein said predefined relational model is stored in any storage system which can implement a relational model.

### Claim 7 (depends on 1)

The method of claim 1, wherein said predefined relational model is stored in a relational database.

### Claim 8 (depends on 1)

The method of claim 1, therein said predefined relational model is stored in an external storage system outside the computer system.

### Claim 9

An apparatus for reconstructing a target hierarchy tree structure from profiling data of a computer system according to a predefined relational model so as to obtain profiling information of a certain selected node, wherein said predefined relational model is defined according to a hierarchy tree structure of said profiling data and includes profiling information of each of nodes in the hierarchy tree structure, said apparatus comprising:
(a) entity array obtaining means for determining entities at each level in a path from a root node to said selected node in said target hierarchy tree structure according to said predefined relational model and definition of said target hierarchy tree structure, so as to obtain an entity array;
(b) identification array obtaining means for obtaining identification information of all the nodes including said selected node in each path from the root node to the selected node in said target hierarchy tree structure according to said entity array, so as to obtain one or more corresponding identification arrays;
(c) row set determining means for selecting from said predefined relational model all the rows having corresponding values of said identification array(s) in those column representing corresponding entities according to said obtained entity array and identification array(s), so as to determine a row set;
(d) grouping means for grouping together, from among all the rows of said row set, those rows having the same identification information in those columns in said predefined relational model, which represent entities of nodes at the next level to said selected node in said target hierarchy tree structure, according to the entity type of said nodes at the next level, so that said row set is divided into one or more groups;
(e) profiling information aggregating means for aggregating profiling information contained in each of all the rows in each group in said predefined relational model, so as to obtain aggregate profiling information of each group; and
(f) profiling information obtaining means for processing the obtained aggregate profiling information of each group to obtain the profiling information of said node in said target hierarchy tree structure.

### Claim 10 (depends on 9)

The apparatus of claim 9, wherein one path from the root node to each leaf node in the hierarchy tree structure of said profiling data is represented as one roe in said predefined relational model, and each row in said predefined relational model further comprises profiling information of the corresponding leaf node in the hierarchy tree structure of said profiling data.

### Claim 11 (depends on 10)

The apparatus of claim 10, wherein said profiling information contains at least used processor time information in the computer system.

### Claim 12 (depends on 11)

The apparatus of claim 11, wherein the profiling information aggregating means sums up the used processor time contained in each rows of every determined groups in said predefined relational model, so that a total used processor time of each group is obtained.

### Claim 13 (depends on 9)

The apparatus of claim 9, wherein, by performing iteration of all the nodes beginning with the root node in said target hierarchy tree structure, the profiling information of all the nodes in said target hierarchy tree structure is obtained in said apparatus.

### Claim 14 (depends on 9)

The apparatus of claim 9, wherein said predefined relational model is read out from a relational database.

### Claim 15 (depends on 9)

The apparatus of claim 9, wherein said predefined relational model it read out from an external storage system outside the computer system.

### Claim 16 (depends on 9)

The apparatus of claim 9, wherein said predefined relational model is read out from any storage system that can implement a relational model.

### Claim 17

A computer program product with computer program code encoded thereon, the computer program code causing a computing apparatus to execute steps of a method when executed on said computing apparatus, the method comprising dynamically constructing a target hierarchy tree structure from profiling data of a computer system according to a predefined relational model so as to obtain profiling information of a certain selected node, wherein said predefined relational model is defined according to profiling objects of said profiling data and includes profiling information of each of nodes in the hierarchy tree structure, said method comprising steps of:
(a) determining entities at each level in a path from a root node to said selected node in said target hierarchy tree structure according to said predefined relational model and definition of said target hierarchy tree structure, so as to obtain an entity array;
(b) obtaining identification information of all the nodes including said selected node in each path from the root node to the selected node in said target hierarchy tree structure according to said entity array, so as to obtain one or more corresponding identification arrays;
(c) selecting from said predefined relational model all the rows having corresponding values of said identification array(s) in those columns representing corresponding entities according to said obtained entity array and identification array(s), so as to determine a row set;
(d) for all the rows of said row set, grouping together those rows having the same identification information in those columns in said predefined relational model, which represent entities of nodes at the next level to avid selected node in said target hierarchy tree structure, according to the entity type of said nodes at the next level, so that said row set is divided into one or more groups;
(e) for all the rows of each of said groups in said predefined relational model, aggregating profiling information contained in each row, so as to obtain aggregate profiling information of each group; and
(f) processing the obtained aggregate profiling information of each group to obtain the profiling information of said node in said target hierarchy tree structure.
