Techniques for managing hierarchical data with link attributes in a relational database

• US 6,965,903 B1
• Filed: 11/26/2002
• Issued: 11/15/2005
• Est. Priority Date: 05/07/2002
• Status: Expired due to Term

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Sedlar, Eric, Chandrasekar, Sivasankaran, Murthy, Ravi, Agarwal, Nipun, Ge, Fei
• Primary Examiner(s): Corrielus, Jean M.
• Application Number:
  US10/306,485
• Time in Patent Office: 1,085 Days
• Field of Search: 707/2, 707/100, 707/101, 707/1, 707/104, 707/3, 707/103, 707/102, 707/6
• US Class Current: 1/1
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99948 Application of database or data structure, e.g. distributed, multimedia, or image

Abstract

Techniques for managing hierarchical data include managing a link table in a relational database. The hierarchical data includes data about a hierarchy of nodes related by multiple links. The link table includes first information, second information and link information, for each link. First information indicates a first node in the hierarchical data. Second information indicates a second node that is associated with the first node by the link. Link information indicates values for link attributes of the link between the first node and the second node, and does not indicate a value for any attribute of the first node alone or any attribute of the second node alone. The techniques support directing a single SQL statement to a path database object, constructed based on the link table, in order to obtain paths that satisfy a search on link attributes.

Claims

1. A method for managing, in a relational database, hierarchical data about a hierarchy of nodes related by a plurality of links, the method comprising the step of:

managing a link table which, for each link of the plurality of links, includes;

first information that indicates a first node in the hierarchical data;

second information that indicates a second node in the hierarchical data, wherein the second node is associated with the first node by the link; and

link information that indicates one or more values for one or more link attributes of the link and does not indicate a value for any attribute of the first node alone or any attribute of the second node alone.

2. The method of claim 1, the method further comprising the step of managing a node table that stores values for a node attribute set of one or more node attributes for each node of a plurality of nodes in the hierarchy.

3. The method of claim 2, wherein:

the first information comprises a reference to a row in the node table; and

the row contains first values for the node attribute set for the first node.

4. The method of claim 2, wherein:

the second information comprises a reference to a row in the node table; and

the row contains second values for the node attribute set for the second node.

5. The method of claim 1, wherein:

a node represents a resource in a file system;

a file of a file system stores content on a computer readable-medium; and

a resource in a file system is one of a file that is not a parent of another resource and a folder that may be a parent of another resource.

6. The method of claim 5, wherein a link comprises a parent-child relationship between a folder and a resource.

7. The method of claim 1, wherein the link information indicates at least one of a link name, a link description, a link type, a link owner, a link owner type, a link creation date, an access control policy for traversing the link to access the child node, and a procedure to invoke when traversing the link to access the child node.

8. The method of claim 1, wherein the link table indicates a cycle comprising a particular plurality of links to a particular child node by including second information that indicates the particular child node for each link of the particular plurality of links.

9. The method of claim 1, wherein:

the method further comprises constructing a path database object describing a plurality of paths from a start node, based on the link table;

each particular path of the plurality of paths describes a unique traversal of the hierarchy from the start node to a particular node;

the path database object includes, for the particular path,

a path name,

node identification that indicates the particular node, and

link identification that indicates a particular link in the link table;

the particular link is along the particular path; and

the second information associated with the particular link in the link table indicates the particular node.

10. The method of claim 9, wherein:

the link information includes a link name; and

the path name for the particular path includes a link name for every link along the path.

11. The method of claim 9, further comprising directing a relational database command to the path database object to obtain a set of one or more path names corresponding to one or more paths that satisfies a search criterion on one or more link attributes.

12. The method of claim 11, where the relational database command is a single command in a standard query language (SQL).

13. The method of claim 9, said step of constructing the path database object further comprising:

determining a current child node linked to a current parent node; and

for the current child node, determining a set of one or more paths leading to the current child node by determining a link in the link table that has second information that indicates the current child node and first information that indicates the current parent node.

14. The method of claim 13, said step of determining a set of one or more paths further comprising the step of adding the link to each path in a set of one or more paths leading to the current parent node.

15. The method of claim 13, wherein:

said step of constructing the path database object further comprises determining a list of zero or more child nodes of the current parent node; and

said step of determining the current child node comprises selecting the current child node from the list.

16. The method of claim 15, said step of determining a list of zero or more child nodes at the current parent node further comprising:

maintaining a hierarchical index that lists the child nodes of each parent node; and

using the index to find each child of the current parent node.

17. A computer-readable medium carrying one or more sequences of instructions for managing, in a relational database, hierarchical data about a hierarchy of nodes related by a plurality of links, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the step of:

managing a link table which, for each link of the plurality of links, includes;

first information that indicates a first node in the hierarchical data;

second information that indicates a second node in the hierarchical data, wherein the second node is associated with the first node by the link; and

link information that indicates one or more values for one or more link attributes of the link and does not indicate a value for any attribute of the first node alone or any attribute of the second node alone.

18. The computer-readable medium of claim 17, wherein execution of the one or more sequences of instructions further causes the one or more processors to perform the step of managing a node table that stores values for a node attribute set of one or more node attributes for each node of a plurality of nodes in the hierarchy.

19. The computer-readable medium of claim 18, wherein:

the first information comprises a reference to a row in the node table; and

the row contains first values for the node attribute set for the first node.

20. The computer-readable medium of claim 18, wherein:

the second information comprises a reference to a row in the node table; and

the row contains second values for the node attribute set for the second node.

21. The computer-readable medium of claim 17, wherein:

a node represents a resource in a file system;

a file of a file system stores content on a computer readable-medium; and

a resource in a file system is one of a file that is not a parent of another resource and a folder that may be a parent of another resource.

22. The computer-readable medium of claim 21, wherein a link comprises a parent-child relationship between a folder and a resource.

23. The computer-readable medium of claim 17, wherein the link information indicates at least one of a link name, a link description, a link type, a link owner, a link owner type, a link creation date, an access control policy for traversing the link to access the child node, and a procedure to invoke when traversing the link to access the child node.

24. The computer-readable medium of claim 17, wherein the link table indicates a cycle comprising a particular plurality of links to a particular child node by including second information that indicates the particular child node for each link of the particular plurality of links.

25. The computer-readable medium of claim 17, wherein:

execution of the one or more sequences of instructions further causes the one or more processors to perform the step of constructing a path database object describing a plurality of paths from a root node, based on the link table;

each particular path of the plurality of paths describes a unique traversal of the hierarchy from the root node to a particular node;

the path database object includes, for the particular path,

a path name,

node identification that indicates the particular node, and

link identification that indicates a particular link in the link table;

the particular link is along the particular path; and

the second information associated with the particular link in the link table indicates the particular node.

26. The computer-readable medium of claim 25, wherein:

the link information includes a link name; and

the path name for the particular path includes a link name for every link along the path.

27. The computer-readable medium of claim 25, wherein execution of the one or more sequences of instructions further causes the one or more processors to perform the step of receiving a relational database command directed to the path database object to obtain a set of one or more path names corresponding to one or more paths that satisfies a search criterion on one or more link attributes.

28. The computer-readable medium of claim 27, where the relational database command is a single statement in a standard query language (SQL).

29. The computer-readable medium of claim 25, said step of constructing the path database object further comprising the steps of:

determining a current child node linked to a current parent node; and

for the current child node, determining a set of one or more paths leading to the current child node by determining a link in the link table that has second information that indicates the current child node and first information that indicates the current parent node.

30. The computer-readable medium of claim 29, said step of determining a set of one or more paths further comprising the step of adding the link to each path in a set of one or more paths leading to the current parent node.

31. The computer-readable medium of claim 29, wherein:

said step of constructing the path database object further comprises determining a list of zero or more child nodes of the current parent node; and

said step of determining the current child node comprises selecting the current child node from the list.

32. The computer-readable medium of claim 31, said step of determining a list of zero or more child nodes at the current parent node further comprising:

maintaining a hierarchical index that lists the child nodes of each parent node; and

using the index to find each child of the current parent node.