VISUAL HIERARCHY EXPLORER
First Claim
1. A computer-readable storage medium having instructions therein that when executed by the machine, cause the machine to:
- receive a graphical tree hierarchy with a plurality of levels, wherein the graphical tree hierarchy includes at least a root node, a plurality of non-leaf nodes, and a plurality of leaf nodes, and wherein the graphical tree hierarchy represents a data structure;
aggregate at least a portion of the plurality of non-leaf nodes at a level of the graphical tree hierarchy, if a subset of the plurality of non-leaf nodes residing at the level exceeds a maximum number of nodes per the level;
scale down the plurality of leaf nodes, if the plurality of levels of the graphical tree hierarchy exceeds a maximum number of levels; and
display the graphical tree hierarchy in a predefined GUI region, the displayed graphical tree is associated with the data structure and accompanying metadata.
1 Assignment
0 Petitions
Accused Products
Abstract
A method and a system are described that involve generating a graphical tree hierarchy of a data structure and its accompanying metadata. In one embodiment, the method includes building a graphical tree hierarchy with a plurality of levels, wherein the graphical tree hierarchy includes at least a root node, a plurality of non-leaf nodes, and a plurality of leaf nodes. Further, the method includes aggregating at least a portion of the plurality of non-leaf nodes at a level of the graphical tree hierarchy, if a subset of the plurality of non-leaf nodes residing at the level exceeds a maximum number of nodes per the level. The method also includes scaling down the plurality of leaf nodes, if the plurality of levels of the graphical tree hierarchy exceeds a maximum number of levels.
158 Citations
20 Claims
-
1. A computer-readable storage medium having instructions therein that when executed by the machine, cause the machine to:
-
receive a graphical tree hierarchy with a plurality of levels, wherein the graphical tree hierarchy includes at least a root node, a plurality of non-leaf nodes, and a plurality of leaf nodes, and wherein the graphical tree hierarchy represents a data structure; aggregate at least a portion of the plurality of non-leaf nodes at a level of the graphical tree hierarchy, if a subset of the plurality of non-leaf nodes residing at the level exceeds a maximum number of nodes per the level; scale down the plurality of leaf nodes, if the plurality of levels of the graphical tree hierarchy exceeds a maximum number of levels; and display the graphical tree hierarchy in a predefined GUI region, the displayed graphical tree is associated with the data structure and accompanying metadata. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A computer implemented method for displaying a tree structure hierarchy on a computer generated user interface, the method comprising:
-
receiving a graphical tree hierarchy with a plurality of levels, wherein the graphical tree hierarchy includes at least a root node, a plurality of non-leaf nodes, and a plurality of leaf nodes, and wherein the graphical tree hierarchy represents a data structure, the data structure stored in a database storage unit; aggregating at least a portion of the plurality of non-leaf nodes at a level of the graphical tree hierarchy, if a subset of the plurality of non-leaf nodes residing at the level exceeds a maximum number of nodes per the level; scaling down the plurality of leaf nodes, if the plurality of levels of the graphical tree hierarchy exceeds a maximum number of levels; and displaying the graphical tree hierarchy as a visualization in a predefined GUI region, the displayed graphical tree associated with the data structure and accompanying metadata. - View Dependent Claims (12, 13, 14, 15, 16, 17)
-
-
18. A computing system comprising:
-
a GUI region with predefined parameters; a hierarchal data structure stored in a database storage unit; a graphical tree structure with a plurality of hierarchal levels including at least a root node, a plurality of non-leaf nodes, and a plurality of leaf nodes, wherein at least a portion of the plurality of non-leaf nodes is aggregated if a subset of the plurality of non-leaf nodes residing at a level of the tree exceeds a maximum number of non-leaf nodes per that level, and wherein the plurality of leaf nodes is scaled down if the levels of the tree exceed a maximum number of levels, and wherein the graphical tree is a visual representation of the hierarchal data structure displayed in the GUI region; and a set of GUI elements to navigate in the graphical tree structure and to retrieve information about the root node, the plurality of non-leaf nodes, and the plurality of leaf nodes. - View Dependent Claims (19, 20)
-
Specification