Path-caching mechanism to improve performance of path-related operations in a repository

• US 9,898,545 B2
• Filed: 01/28/2015
• Issued: 02/20/2018
• Est. Priority Date: 11/21/2005
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Idicula, Sam, Agarwal, Nipun, Murthy, Ravi, Sedlar, Eric
• Primary Examiner(s): Louie, Oscar
• Assistant Examiner(s): Forman, James
• Application Number:
  US14/608,029
• Publication Number:
  US 20150186543A1
• Time in Patent Office: 1,119 Days
• CPC Class Codes: G06F 12/0246 in block erasable memory, e.g. flash memory
• CPC Class Codes: G06F 12/0817 using directory methods
• CPC Class Codes: G06F 12/0833 in combination with broadcast means (e.g. for invalidation or updating)
• CPC Class Codes: G06F 16/13 File access structures, e.g. distributed indices arrangements of input from, or output to, record carriers G06F3/06
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: G06F 16/972 Access to data in other repository systems, e.g. legacy data or dynamic Web page generation
• CPC Class Codes: G06F 2212/62 Details of cache specific to multiprocessor cache arrangements
• CPC Class Codes: G06F 2212/622 State-only directory, i.e. not recording identity of sharing or owning nodes
• CPC Class Codes: G06F 2212/7204 Capacity control, e.g. partitioning, end-of-life degradation

Abstract

A method and apparatus for processing path-based database operations is provided. According to one aspect, a path cache is maintained. For each hierarchical node that is traversed during a path-determining operation, it is determined whether a cache entry corresponding to that node is already contained in the path cache. If such a cache entry is already contained in the path cache, then the path indicated in that cache entry is used to complete the pathname for the node for which the operation is being performed. As a result, hierarchically higher nodes do not need to be traversed to complete the operation. Alternatively, if such a cache entry is not already contained in the path cache, then a cache entry for the node currently being traversed is generated and inserted into the path cache for use in subsequent path-determining operations.

Claims

1. A computer-implemented method of processing path-based operations, the method comprising:

storing, in a particular cache entry in a path cache, a separation value that indicates a quantity of nodes that separate a particular node from a root node in a hierarchy of nodes;

wherein the particular cache entry in the path cache includes a pathname that specifies a complete path from the root node to the particular node in the hierarchy of nodes;

determining that at least one cache entry is to be evicted from the path cache based on the path cache being full and a new cache entry needing to be inserted;

in response to the determination that at least one cache entry is to be evicted from the path cache, selecting the particular cache entry for eviction from the path cache based at least in part on the separation value;

wherein cache entries with higher separation values are selected for eviction before cache entries with lower separation values;

evicting the selected particular cache entry from the path cache;

wherein the method is performed by one or more computing devices.

2. The method of claim 1 further comprising:

in response to a request to determine a complete path to a requestor-specified first node, and upon determining that the path cache does not contain a first cache entry that specifies a complete path from the root node to the first node, which is an immediate child of a second node in the hierarchy of nodes, determining whether the path cache contains a second cache entry that specifies a complete path from the root node to the second node; and

upon determining that the path cache does not contain the second cache entry, automatically determining a pathname that specifies the complete path from the root node to the second node and inserting, into the path cache, the particular cache entry that (a) corresponds to the second node and (b) indicates the pathname for the second node.

3. The method of claim 2, wherein the step of determining whether the path cache contains the second cache entry is performed in response to an execution, relative to a relational database, of a Structured Query Language (SQL) query whose results depend at least in part on the pathname.

4. The method of claim 2, wherein the step of determining whether the path cache contains the second cache entry is performed in response to an execution, relative to a relational database, of a Structured Query Language (SQL) query whose results depend at least in part on a determination of whether the first node is within a specified path in the hierarchy of nodes.

5. The method of claim 2, further comprising:

locating, in a relational database table, a first row that corresponds to the first node; and

locating, in the first row, an attribute that identifies a location, in the relational database table, of a second row that corresponds to the second node.

6. The method of claim 2, wherein the step of automatically determining the pathname that specifies the complete path from the root node to the second node further comprises:

determining the complete path from the root node to the second node based at least in part on information contained in a directory links table that contains, for at least one node in the hierarchy, an array storing multiple row identifiers of multiple parents of said at least one node in the hierarchy.

7. A non-transitory computer-readable medium storing instructions which, when executed by one or more processors, cause:

storing, in a particular cache entry in a path cache, a separation value that indicates a quantity of nodes that separate a particular node from a root node in a hierarchy of nodes;

wherein the particular cache entry in the path cache includes a pathname that specifies a complete path from the root node to the particular node in the hierarchy of nodes;

determining that at least one cache entry is to be evicted from the path cache based on the path cache being full and a new cache entry needing to be inserted;

in response to the determination that at least one cache entry is to be evicted from the path cache, selecting the particular cache entry for eviction from the path cache based at least in part on the separation value;

wherein cache entries with higher separation values are selected for eviction before cache entries with lower separation values;

evicting the selected particular cache entry from the path cache.

8. The computer-readable medium of claim 7, wherein the instructions further cause:

in response to a request to determine a complete path to a requestor-specified first node, and upon determining that the path cache does not contain a first cache entry that specifies a complete path from the root node to the first node, which is an immediate child of a second node in the hierarchy of nodes, determining whether the path cache contains a second cache entry that specifies a complete path from the root node to the second node; and

upon determining that the path cache does not contain the second cache entry, automatically determining a pathname that specifies the complete path from the root node to the second node and inserting, into the path cache, the particular cache entry that (a) corresponds to the second node and (b) indicates the pathname for the second node.

9. The computer-readable medium of claim 8, wherein determining whether the path cache contains the second cache entry is performed in response to an execution, relative to a relational database, of a Structured Query Language (SQL) query whose results depend at least in part on the pathname.

10. The computer-readable medium of claim 8, wherein determining whether the path cache contains the second cache entry is performed in response to an execution, relative to a relational database, of a Structured Query Language (SQL) query whose results depend at least in part on a determination of whether the first node is within a specified path in the hierarchy of nodes.

11. The computer-readable medium of claim 8, wherein the instructions further cause:

locating, in a relational database table, a first row that corresponds to the first node; and

locating, in the first row, an attribute that identifies a location, in the relational database table, of a second row that corresponds to the second node.

12. The computer-readable medium of claim 8, wherein automatically determining the pathname that specifies the complete path from the root node to the second node further comprises:

determining the complete path from the root node to the second node based at least in part on information contained in a directory links table that contains, for at least one node in the hierarchy, an array storing multiple row identifiers of multiple parents of said at least one node in the hierarchy.

13. A method comprising:

storing, in a particular cache entry in a path cache, a descendant value that indicates a quantity of other nodes that descend from a particular node in a hierarchy of nodes;

wherein the particular cache entry in the path cache includes a pathname that specifies a complete path from a root node to the particular node in the hierarchy of nodes;

determining that at least one cache entry is to be evicted from the path cache based on the path cache being full and a new cache entry needing to be inserted;

in response to the determination that at least one cache entry is to be evicted from the path cache, selecting the particular cache entry for eviction from the path cache based at least in part on the descendant value;

evicting the selected particular cache entry from the path cache;

wherein the method is performed by one or more computing devices.

14. The method of claim 13, further comprising:

in response to a descendant of the particular node being added to or removed from the hierarchy, updating the descendant value in the particular cache entry.

15. The method of claim 13 wherein selecting the particular cache entry for eviction from

the path cache based at least in part on dividing the descendant value by a total number of nodes in the hierarchy.

16. The method of claim 13 wherein cache entries with lower descendant values are selected for eviction before cache entries with higher descendant values.

17. A non-transitory computer-readable medium storing instructions which, when executed by one or more processors, cause:

storing, in a particular cache entry in a path cache, a descendant value that indicates a quantity of other nodes that descend from a particular node in a hierarchy of nodes;

wherein the particular cache entry in the path cache includes a pathname that specifies a complete path from a root node to the particular node in the hierarchy of nodes; and

determining that at least one cache entry is to be evicted from the path cache based on the path cache being full and a new cache entry needing to be inserted;

in response to the determination that at least one cache entry is to be evicted from the path cache, selecting the particular cache entry for eviction from the path cache based at least in part on the descendant value;

evicting the selected particular cache entry from the path cache.

18. The computer-readable medium of claim 17, wherein the instructions further cause:

in response to a descendant of the particular node being added to or removed from the hierarchy, updating the descendant value in the particular cache entry.

19. The computer-readable medium of claim 17, wherein selecting the particular cache entry for eviction from the path cache based at least in part on dividing the descendant value by a total number of nodes in the hierarchy.

20. The computer-readable medium of claim 17, wherein cache entries with lower descendant values are selected for eviction before cache entries with higher descendant values.