Automatic generation of hierarchy visualizations

• US 9,824,471 B2
• Filed: 09/26/2013
• Issued: 11/21/2017
• Est. Priority Date: 09/27/2012
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Lei, Louis Y., Portal, Frederic, Morcos, Amira A., Sondhi, Bhupinder Singh, Muralidharan, Tamijselvy, Dubey, Richa
• Primary Examiner(s): Chow, Jeffrey
• Application Number:
  US14/038,640
• Publication Number:
  US 20140085307A1
• Time in Patent Office: 1,517 Days
• CPC Class Codes: G06F 16/26 Visual data mining; Browsing structured data
• CPC Class Codes: G06F 16/283 Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs
• CPC Class Codes: G06T 17/005 Tree description, e.g. octree, quadtree

Abstract

A method, system, and computer program product for presentation of data in enterprise applications. The method form commences by identifying a hierarchy of data maintained by an enterprise application (e.g., in a database). A hierarchy processor or other processor reads the hierarchy of data to configure a graphical representation of the hierarchy of data to be displayed on a display device. The graphical representation includes a graphical display indication corresponding to one or more relationships between items in the displayed hierarchy. Additional display indications include a calculated summary value of aggregated data, such as where the aggregated data is calculated using an aggregation function.

Claims

1. A computer implemented method for generating user selected hierarchies, the method comprising:

facilitating a presentation of a data structure that;

includes a plurality of nodes;

identifies, for each node of the plurality of nodes, one or more relationships between the node and at least one other node of the plurality of nodes; and

associates, for each node of the plurality of nodes, the node with each of one or more data values, each data value of the one or more data values being associated with a corresponding value type;

receiving, from a user device and responsive to the presentation, a selection of;

a focus node from amongst the plurality of nodes;

a focus value type;

traversing the data structure to detect for each node of the plurality of nodes a one or more node relationships;

generating a node hierarchy from the one or more node relationships, wherein the node hierarchy includes;

an incomplete subset of the plurality of nodes, the incomplete subset including the focus node and a set of lower level nodes;

a set of connections, each connection of the set of connections connecting two nodes of the incomplete subset and corresponding to a relationship between the two nodes;

level data that associates the focus node with a top level of the node hierarchy and that associates each of the set of lower level nodes with a lower level in the node hierarchy below the top level in the node hierarchy;

identifying a focus-data value for the focus node to be a data value that is of the focus value type and that is of the one or more data values associated with the focus node;

identifying, for each lower level node of the set of lower level nodes, a data value for the node that is of the focus value type and that is of the one or more data values associated with the node; and

defining an aggregated-data value based on the data values identified for each of the lower level nodes in the set of lower level nodes;

generating a graphical representation of the node hierarchy that includes representations of;

the level data; and

the set of connections, each connection of the set of connections connecting two nodes of the incomplete subset and corresponding to a relationship between the two nodes;

the focus-data value; and

the aggregated-data value; and

sending the graphical representation to the user device.

2. The method of claim 1, wherein the aggregated-data value is calculated using an aggregation function.

3. The method of claim 2, wherein the aggregation function is calculated based on at least one of, a SUM function, a COUNT function, a MAX function, or a MIN function.

4. The method of claim 1, in which the graphical representation includes using an arrow for each connection of the set of connections.

5. The method of claim 1, in which the graphical representation comprises:

selecting an entity for display;

retrieving attributes for the entity; and

using a template to configure the attributes of the graphical representation.

6. The method of claim 5, in which the attributes comprise at least aggregated data.

7. The method of claim 5, wherein the template is defined by:

specifying, in a first interface, an attribute of the entity;

specifying, in a second interface, an attribute field that includes the attributes as a data source, wherein the attribute field corresponds to a display field in the graphical representation; and

providing, in a third interface, a template that configures a grouping of one or more attribute fields to define a layout for the graphical representation.

8. The method of claim 1, further comprising providing a framework to store parameters and configuration controls for graphical representation.

9. The method of claim 8, in which the framework implements configuration of the node hierarchy displayed with multiple levels of customization.

10. The method of claim 1, in which the presentation of the data structure provides information at multiple levels of the node hierarchy.

11. The method of claim 1, in which an interface rendering module is used to generate the graphical representation of the node hierarchy on the user device.

12. The method of claim 1, in which identifying the node hierarchy comprises:

storing the set of connections into a table structure having hierarchical information for the focus node and any lower level node of the set of lower level nodes from the focus node, wherein the table structure comprises;

(1) a first column storing an identifier for a node;

(2) a second column storing the identifier for a lower level node of the set of lower level nodes of the node identified in the first column; and

(3) a third column storing a data value for the node identified in the first column; and

generating the aggregated-data value for the node by identifying data contributions from the third column of the table structure for all lower level node of the set of lower level nodes corresponding to the node, where the lower level node of the set of lower level nodes are identified from the second column of the table structure.

13. The method of claim 1, in which identifying the node hierarchy comprises:

storing the set of connections into a table structure having hierarchical information for the focus node and any lower level node of the set of lower level nodes from the focus node, wherein the table structure comprises;

(1) a first column storing an identifier for a node;

(2) a second column storing the identifier for a lower level node of the set of lower level nodes of the node identified in the first column; and

(3) a third column storing a data value for the node identified in the first column; and

generating the aggregated-data value for the node by identifying a parent node for the node from the second column of the table structure, and calculating a rollup value for the node from the third column of the table structure.

14. A computer program product for generating user selected hierarchies embodied in a non-transitory computer readable medium, the non-transitory computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a process, the process comprising:

facilitating a presentation of a data structure that;

includes a plurality of nodes;

identifies, for each node of the plurality of nodes, one or more relationships between the node and at least one other node of the plurality of nodes; and

associates, for each node of the plurality of nodes, the node with each of one or more data values, each data value of the one or more data values being associated with a corresponding value type;

receiving, from a user device and responsive to the presentation, a selection of;

a focus node from amongst the plurality of nodes;

a focus value type;

traversing the data structure to detect for each node of the plurality of nodes, a one or more node relationships;

generating a node hierarchy from the one or more node relationships, wherein the node hierarchy includes;

an incomplete subset of the plurality of nodes, the incomplete subset including the focus node and a set of lower level nodes;

a set of connections, each connection of the set of connections connecting two nodes of the incomplete subset and corresponding to a relationship between the two nodes;

level data that associates the focus node with a top level of the node hierarchy and that associates each of the set of lower level nodes with a lower level in the node hierarchy below the top level in the node hierarchy;

identifying a focus-data value for the focus node to be a data value that is of the focus value type and that is of the one or more data values associated with the focus node;

identifying, for each lower level node of the set of lower level nodes, a data value for the node that is of the focus value type and that is of the one or more data values associated with the node; and

defining an aggregated-data value based on the data values identified for each of the lower level nodes in the set of lower level nodes;

generating a graphical representation of the node hierarchy that includes representations of;

the level data; and

the set of connections, each connection of the set of connections connecting two nodes of the incomplete subset and corresponding to a relationship between the two nodes;

the focus-data value; and

the aggregated-data value; and

sending the graphical representation to the user device.

15. The computer program product of claim 14, wherein the aggregated-data value is calculated using an aggregation function.

16. The computer program product of claim 15, wherein the aggregation function is based on at least one of, a SUM function, a COUNT function, a MAX function, or a MIN function.

17. The computer program product of claim 14, in which the graphical representation includes using an arrow for each connection of the set of connections.

18. The computer program product of claim 14, in which the graphical representation comprises:

selecting an entity for display;

retrieving attributes for the entity; and

using a template to configure the attributes of the graphical representation.

19. The computer program product of claim 18, in which the attributes comprise at least aggregated data.

20. The computer program product of claim 18, wherein the template is defined by:

specifying, in a first interface, an attribute of the entity;

specifying, in a second interface, an attribute field that includes the attributes as a data source, wherein the attribute field corresponds to a display field in the presentation of the data structure; and

providing, in a third interface, a template that configures a grouping of one or more attribute fields to define a layout for the graphical representation.

21. The computer program product of claim 14, further comprising instructions for providing a framework to store parameters and configuration controls for presentation of the data structure.

22. The computer program product of claim 21, in which the framework implements configuration of the node hierarchy displayed in the node hierarchy with multiple levels of customization.

23. The computer program product of claim 14, in which the presentation of the data structure provides information at multiple levels of the node hierarchy.

24. The computer program product of claim 14, in which an interface rendering module is used to generate the graphical representation of the node hierarchy on the user device.

25. The computer program product of claim 14, in which identifying the node hierarchy comprises:

storing the set of connections into a table structure having hierarchical information for the focus node and any lower level node of the set of lower level nodes from the focus node, wherein the table structure comprises;

(1) a first column storing an identifier for a node;

(2) a second column storing the identifier for a lower level node of the set of lower level nodes of the node identified in the first column; and

(3) a third column storing a data value for the node identified in the first column; and

generating the aggregated-data value for the node by identifying data contributions from the third column of the table structure for all lower level node of the set of lower level nodes corresponding to the node, where the lower level node of the set of lower level nodes are identified from the second column of the table structure.

26. The computer program product of claim 14, in which identifying the node hierarchy comprises:

storing the set of connections into a table structure having hierarchical information for the focus node and any lower level node of the set of lower level nodes from the focus node, wherein the table structure comprises;

(1) a first column storing an identifier for a node;

(2) a second column storing the identifier for a lower level node of the set of lower level nodes of the node identified in the first column; and

(3) a third column storing a data value for the node identified in the first column; and

generating the aggregated-data value for the node by identifying a parent node for the node from the second column of the table structure, and calculating a rollup value for the node from the third column of the table structure.

27. A computer system for generating user selected hierarchies, the computer system comprising:

one or more processors performing actions of;

facilitating a presentation of a data structure that;

includes a plurality of nodes;

identifies, for each node of the plurality of nodes one or more relationships between the node and at least one other node of the plurality of nodes; and

associates, for each node of the plurality of nodes, the node with each of one or more data values, each data value of the one or more data values being associated with a corresponding value type;

receiving, from a user device and responsive to the presentation, a selection of;

a focus node from amongst the plurality of nodes;

a focus value type;

traversing the data structure to detect for each node of the plurality of nodes, one or more node relationships between the node and at least one other node of the plurality of nodes;

generating a node hierarchy from one or more node relationships between the node and at least one other node of the plurality of nodes, wherein the node hierarchy includes;

an incomplete subset of the plurality of nodes, the incomplete subset including the focus node and a set of lower level nodes;

a set of connections, each connection of the set of connections connecting two nodes of the incomplete subset and corresponding to a relationship between the two nodes;

level data that associates the focus node with a top level of the node hierarchy and that associates each of the set of lower level nodes with a lower level in the node hierarchy below the top level in the node hierarchy;

identifying a focus-data value for the focus node to be a data value that is of the focus value type and that is of the one or more data values associated with the focus node;

identifying, for each lower level node of the set of lower level nodes, a data value for the node that is of the focus value type and that is of the one or more data values associated with the node; and

defining an aggregated-data value based on the data values identified for each of the lower level nodes in the set of lower level nodes;

generating a graphical representation of the node hierarchy that includes representations of;

the level data; and

the set of connections, each connection of the set of connections connecting two nodes of the incomplete subset and corresponding to a relationship between the two nodes;

the focus-data value; and

the aggregated-data value; and

sending the graphical representation to the user device.

28. The computer system of claim 27, wherein the aggregated-data value is calculated using an aggregation function.

29. The computer system of claim 27, in which an interface rendering module is used to generate the graphical representation on the user device.

30. The computer system of claim 28, wherein the aggregation function is based on at least one of, a SUM function, a COUNT function, a MAX function, or a MIN function.

31. The computer system of claim 27, in which the graphical representation includes using an arrow for each connection of the set of connections.

32. The computer system of claim 27, in which the graphical representation comprises:

selecting an entity for display;

retrieving attributes data for the entity; and

using a template to configure the attributes data of the graphical representation.

33. The computer system of claim 32, in which the attributes data comprise at least aggregated data.

34. The computer system of claim 32, wherein the template is defined by:

specifying, in a first interface, an attribute of the entity;

specifying, in a second interface, an attribute field that includes the attributes as a data source, wherein the attribute field corresponds to a display field in the graphical representation; and

providing, in a third interface, a template that configures a grouping of one or more attribute fields to define a layout for the graphical representation.

35. The computer system of claim 27, further comprising:

a framework to store parameters and configuration controls for displaying the node hierarchy.

36. The computer system of claim 35, in which the framework implements configuration of the node hierarchy,

displayed in the node hierarchy with multiple levels of customization.

37. The computer system of claim 27, in which a displayed node hierarchy provides information at multiple levels of the node hierarchy.

38. The computer system of claim 27, in which identifying the node hierarchy comprises:

storing the set of connections into a table structure having hierarchical information for the focus node and any lower level node of the set of lower level nodes from the focus node, wherein the table structure comprises;

(1) a first column storing an identifier for a node;

(2) a second column storing the identifier for a lower level node of the set of lower level nodes of the node identified in the first column; and

(3) a third column storing a data value for the node identified in the first column; and

generating the aggregated-data value for the node by identifying data contributions from the third column of the table structure for all lower level node of the set of lower level nodes child nodes corresponding to the node, where the lower level node of the set of lower level nodes child nodes are identified from the second column of the table structure.

39. The computer system of claim 27, in which identifying the node hierarchy comprises:

storing the set of connections into a table structure having hierarchical information for the focus node and any lower level node of the set of lower level nodes from the focus node, wherein the table structure comprises;

(1) a first column storing an identifier for a node;

(2) a second column storing the identifier for a lower level node of the set of lower level nodes of the node identified in the first column; and

(3) a third column storing a data value for the node identified in the first column; and

generating the aggregated-data value for the node by identifying a parent node for the node from the second column of the table structure, and calculating a rollup value for the node from the third column of the table structure.