Hierarchy Nodes Derived Based On Parent/Child Foreign Key And/Or Range Values On Parent Node

• US 20110022639A1
• Filed: 07/27/2010
• Published: 01/27/2011
• Est. Priority Date: 11/13/2007
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Martinsson, Lars E., Dumay, Mikhail
• Granted Patent: US 9,400,814 B2
• Time in Patent Office: Days
• US Class Current: 707/797
• CPC Class Codes: G06F 16/2228 Indexing structures

Abstract

Nodes of a tree are dynamically generated. A user may specify that a node should have a separate child node for each unique value that occurs in a particular column of a relational table. A user may specify that a node should have a separate child node for each range of values in a user-specified set of ranges. Child nodes of a particular node may be dynamically determined and displayed by querying one or more relational tables for records that satisfy all of the criteria that are implied by that particular node and that particular node'"'"'s parents. As a result of the foregoing techniques, users are not forced to create a tree node-by-node; instead, users can specify criteria based on which a whole level of nodes should be created, and a whole level of nodes may be added to a tree based on those criteria.

Claims

1. A computer-implemented method comprising steps of:

receiving a set of user-specified criteria;

adding to a tree structure, a first set of two or more nodes that are determined based at least in part on the user-specified criteria;

associating, with each node in the first set, a separate set of criteria that are based at least in part on the user-specified criteria;

displaying the tree structure to which the nodes in the first set have been added;

receiving user input that indicates selection of a particular node from the first set;

in response to receiving the user input, determining one or more records that satisfy the set of criteria that is associated with the particular node;

adding, to the tree structure, a second set of nodes that are generated based at least in part on the one or more records; and

displaying the tree structure to which the nodes in the second set have been added.

wherein the user-specified criteria specifies a set of two or more ranges, and wherein adding the first set of nodes to the tree structure comprises adding, to the tree structure, a separate node for each range in the set of two or more ranges;

wherein the steps are performed by one or more computing devices.

2. The method of claim 1, wherein the user-specified criteria specifies a column in a relational database table;

wherein adding the first set of nodes to the tree structure comprises adding, to the tree structure, for each unique value that occurs in the column of the relational database table, only one node for said unique value; and

wherein the column includes multiple instances of at least one unique value that occurs in the column.

3. The method of claim 1, wherein the user-specified criteria specifies a set of two or more columns in a relational database table, and wherein adding the first set of nodes to the tree structure comprises adding, to the tree structure, a separate node for each unique set of values that occur in the columns of the relational database table.

4. The method of claim 1, wherein the user-specified criteria specifies a column in a relational database table;

and wherein adding, to the tree structure, the second set of nodes that are generated based at least in part on the one or more records comprises adding a separate node as a child of the particular node for each record of the table whose value in said column is within a particular range that is associated with said particular node and no other node on a same hierarchical level of the tree structure as said particular node.

5. The method of claim 1, further comprising:

determining nodes at a first level of the tree structure based at least in part on ranges within a set of ranges; and

determining nodes at a second level of the tree structure based on unique values in a column of a relational database table and without regard to any ranges.

6. The method of claim 1, further comprising:

determining nodes at a first level of the tree structure based at least in part on values that occur in a first relational database table;

determining nodes at a second level of the tree structure based at least in part on values that occur in a second relational database table that is separate from the first relational database table; and

determining nodes at a third level of the tree structure based at least in part on values that occur in a third relational database table that is separate from both the first relational database table and the second relational database table.

7. The method of claim 1, further comprising:

adding two or more nodes to a first level of the tree structure;

associating each node of the first level of the tree structure with different criteria than criteria associated with each other node of the first level of the tree structure;

for each node of the first level of the tree structure, adding two or more nodes as children of that node of the first level;

for each child of each particular node of the first level of the tree structure, associating, with that child, criteria that are different than any criteria that are associated with any other node that is also a child of that particular node;

in response to a user'"'"'s selection of a selected node in the tree structure, determining children for the selected node based on records that satisfy (a) criteria that are associated with the selected node and also (b) criteria that are associated with ancestors of the selected node; and

displaying the children of the selected node.

8. The method of claim 1, further comprising:

determining, at a first time, and based at least in part on contents of a relational database table at the first time, child nodes of a particular node in the tree structure;

displaying the child nodes determined at the first time;

determining, at a second time that occurs after the first time, and based at least in part on contents of the relational database table at the second time, child nodes of the particular node in the tree structure; and

displaying the child nodes determined at the second time;

wherein the child nodes determined at the first time differ from the child nodes determined at the second time.

9. The method of claim 1, wherein the step of adding the first set of two or more nodes to the tree structure is performed without any user adding any node in the first set to the tree structure individually.

10. The method of claim 1, further comprising:

adding two or more nodes simultaneously to a first level of the tree structure in response to receiving user input that specifies criteria for generating the two or more nodes; and

adding, to each node in the first level of the tree structure, simultaneously, two or more child nodes in response to receiving user input that specifies criteria for generating all of the child nodes.

11. A machine-readable non-transitory storage medium storing instructions which, when executed by one or more processors, cause the one or more processors to perform certain steps comprising:

receiving a set of user-specified criteria;

adding to a tree structure, a first set of two or more nodes that are determined based at least in part on the user-specified criteria;

associating, with each node in the first set, a separate set of criteria that are based at least in part on the user-specified criteria;

displaying the tree structure to which the nodes in the first set have been added;

receiving user input that indicates selection of a particular node from the first set;

in response to receiving the user input, determining one or more records that satisfy the set of criteria that is associated with the particular node;

adding, to the tree structure, a second set of nodes that are generated based at least in part on the one or more records; and

displaying the tree structure to which the nodes in the second set have been added.

wherein the user-specified criteria specifies a set of two or more ranges, and wherein adding the first set of nodes to the tree structure comprises adding, to the tree structure, a separate node for each range in the set of two or more ranges.

12. The machine-readable non-transitory storage medium of claim 11, wherein the user-specified criteria specifies a column in a relational database table;

wherein adding the first set of nodes to the tree structure comprises adding, to the tree structure, for each unique value that occurs in the column of the relational database table, only one node for said unique value; and

wherein the column includes multiple instances of at least one unique value that occurs in the column.

13. The machine-readable non-transitory storage medium of claim 11, wherein the user-specified criteria specifies a set of two or more columns in a relational database table, and wherein adding the first set of nodes to the tree structure comprises adding, to the tree structure, a separate node for each unique set of values that occur in the columns of the relational database table.

14. The machine-readable non-transitory storage medium of claim 11, wherein the user-specified criteria specifies a column in a relational database table;

and wherein adding, to the tree structure, the second set of nodes that are generated based at least in part on the one or more records comprises adding a separate node as a child of the particular node for each record of the table whose value in said column is within a particular range that is associated with said particular node and no other node on a same hierarchical level of the tree structure as said particular node.

15. The machine-readable non-transitory storage medium of claim 11, wherein the certain steps further comprise:

determining nodes at a first level of the tree structure based at least in part on ranges within a set of ranges; and

determining nodes at a second level of the tree structure based on unique values in a column of a relational database table and without regard to any ranges.

16. The machine-readable non-transitory storage medium of claim 11, wherein the steps further comprise:

determining nodes at a first level of the tree structure based at least in part on values that occur in a first relational database table;

determining nodes at a second level of the tree structure based at least in part on values that occur in a second relational database table that is separate from the first relational database table; and

determining nodes at a third level of the tree structure based at least in part on values that occur in a third relational database table that is separate from both the first relational database table and the second relational database table.

17. The machine-readable non-transitory storage medium of claim 11, wherein the steps further comprise:

adding two or more nodes to a first level of the tree structure;

associating each node of the first level of the tree structure with different criteria than criteria associated with each other node of the first level of the tree structure;

for each node of the first level of the tree structure, adding two or more nodes as children of that node of the first level;

for each child of each particular node of the first level of the tree structure, associating, with that child, criteria that are different than any criteria that are associated with any other node that is also a child of that particular node;

in response to a user'"'"'s selection of a selected node in the tree structure, determining children for the selected node based on records that satisfy (a) criteria that are associated with the selected node and also (b) criteria that are associated with ancestors of the selected node; and

displaying the children of the selected node.

18. The machine-readable non-transitory storage medium of claim 11, wherein the steps further comprise:

determining, at a first time, and based at least in part on contents of a relational database table at the first time, child nodes of a particular node in the tree structure;

displaying the child nodes determined at the first time;

determining, at a second time that occurs after the first time, and based at least in part on contents of the relational database table at the second time, child nodes of the particular node in the tree structure; and

displaying the child nodes determined at the second time;

wherein the child nodes determined at the first time differ from the child nodes determined at the second time.

19. The machine-readable non-transitory storage medium of claim 11, wherein the step of adding the first set of two or more nodes to the tree structure is performed without any user adding any node in the first set to the tree structure individually.

20. The machine-readable non-transitory storage medium of claim 11, wherein the steps further comprise:

adding two or more nodes simultaneously to a first level of the tree structure in response to receiving user input that specifies criteria for generating the two or more nodes; and

adding, to each node in the first level of the tree structure, simultaneously, two or more child nodes in response to receiving user input that specifies criteria for generating all of the child nodes.