US 8,713,056 B1Granted

System, method and computer program product for efficient caching of hierarchical items

AssigneeOpen Text Corporation

InventorsAdison Hana Wongkar, Shaival Gupta

Life of this patent

Estimating the term…

Loading patent…

Abstract

Embodiments disclosed herein provide a “lazy” approach in caching a hierarchical navigation tree with one or more associated permission trees. In one embodiment, only a portion of a cached permission tree is updated. One embodiment of a method may comprise determining whether a dirty node exists by comparing tree timestamps of the permission tree and the master tree. If the tree timestamp of the master tree is temporally more recent than the tree timestamp of the permission tree, the permission tree has a dirty node and the method may operate to check node timestamps of the master and permission trees. This process may be repeated until the dirty node is found, at which time a portion of the permission tree associated with the dirty node may be reconstructed, rather than the entire permission tree itself, thereby eliminating or significantly reducing access time to the cached permission tree.

Claims17

Dependent claims

A method of caching hierarchical items in a network environment, the method comprising:

at a server computer, responsive to a user action at a client device communicatively connected to the server computer, determining, by the server computer, that a node in a permission tree associated with the user is a dirty node relative to a node in a hierarchical navigation tree, the permission tree representing a portion of the hierarchical navigation tree, the hierarchical navigation tree representing a network site in the network environment, and the hierarchical navigation tree having a plurality of nodes representing the hierarchical items of the network site;
reconstructing, by the server computer, a portion of the permission tree associated with the dirty node;
and
updating, by the server computer, a node timestamp and a tree timestamp associated with the dirty node, the dirty node representing one of the hierarchical items of the network site;
wherein the determining comprises comparing a root tree timestamp of the hierarchical navigation tree with a root tree timestamp of the permission tree and if the root tree time stamp of the hierarchical navigation tree is more recent than the root tree timestamp of the permission tree, comparing node time stamps of each node in the permission tree with node time stamps of corresponding nodes in the hierarchical navigation tree, wherein the determining further comprises comparing a tree timestamp for a node in the hierarchical navigation tree with a tree timestamp for a corresponding node in the permission tree if a node time stamp for the node in the hierarchical navigation tree is not more recent than a node time stamp for the corresponding node in the permission tree.

2 more elements

A computer program product comprising at least one non-transitory computer readable medium storing instructions translatable by a server computer to perform:

determining a node in a permission tree associated with a user at a client device communicatively connected to the server computer is a dirty node relative to a node in a hierarchical navigation tree, the permission tree representing a portion of the hierarchical navigation tree, the hierarchical navigation tree representing a network site in the network environment, and the hierarchical navigation tree having a plurality of nodes representing the hierarchical items of the network site;
reconstructing a portion of the permission tree associated with the dirty node;
and
updating a node timestamp and a tree timestamp associated with the dirty node, the dirty node representing one of the hierarchical items of the network site;
wherein the determining comprises comparing a root tree timestamp of the hierarchical navigation tree with a root tree timestamp of the permission tree and if the root tree time stamp of the hierarchical navigation tree is more recent than the root tree timestamp of the permission tree, comparing node time stamps of each node in the permission tree with node time stamps of corresponding nodes in the hierarchical navigation tree, wherein the determining further comprises comparing a tree timestamp for a node in the hierarchical navigation tree with a tree timestamp for a corresponding node in the permission tree if a node time stamp for the node in the hierarchical navigation tree is not more recent than a node time stamp for the corresponding node in the permission tree.

2 more elements

A system, comprising:

one or more server computers communicatively connected to one or more client devices, at least one of the server computers being configured to perform:
determining a dirty node in a permission tree associated with a user at one of the one or more client devices is a dirty node relative to a node in a hierarchical navigation tree, the permission tree representing a portion of the hierarchical navigation tree, the hierarchical navigation tree representing a network site in the network environment, and the hierarchical navigation tree having a plurality of nodes representing the hierarchical items of the network site;
reconstructing a portion of the permission tree associated with the dirty node;
and
updating a node timestamp and a tree timestamp associated with the dirty node, the dirty node representing one of the hierarchical items of the network site;
wherein the determining comprises comparing a root tree timestamp of the hierarchical navigation tree with a root tree timestamp of the permission tree and if the root tree time stamp of the hierarchical navigation tree is more recent than the root tree timestamp of the permission tree, comparing node time stamps of each node in the permission tree with node time stamps of corresponding nodes in the hierarchical navigation tree, wherein the determining further comprises comparing a tree timestamp for a node in the hierarchical navigation tree with a tree timestamp for a corresponding node in the permission tree if a node time stamp for the node in the hierarchical navigation tree is not more recent than a node time stamp for the corresponding node in the permission tree.

3 more elements

Dependencies are inferred from the claim text.

Facts

Application: 13/435,427Filed 30 Mar 2012 · us provisional application
Priority: 30 Mar 2011
Granted: 29 Apr 2014
Term ends: Not estimatedThe source records don’t support an estimate.

Classification7 codes

H04L 63/0281
For separating internal from external traffic, e.g. firewalls: proxies
G06F 16/13
File systems; File servers: file access structures, e.g. distributed indices
G06F 16/2246
Indexing structures: trees, e.g. B+trees
H04L 7/0008
Arrangements for synchronising receiver with transmitter: synchronisation information channels, e.g. clock distribution lines