System and method for processing a hierarchical data tree
First Claim
1. A method for performing an operation on a hierarchical data tree, comprising:
- visiting an anchor node in the tree;
retrieving data from the anchor node and a plurality of neighboring nodes each potentially affected by the operation;
querying a cache for a key representing the anchor node and the plurality of neighboring nodes in a pre-operation condition based on the retrieved data, wherein the cache stores pre-operation/post-operation data pairs;
if the query finds a match, replacing the pre-operation retrieved data with cached post-operation data; and
if the query does not find a match, performing the operation on the pre-operation retrieved data to generate post-operation data, replacing the pre-operation retrieved data with the post-operation data and storing the post-operation data in the cache with the associated pre-operation retrieved data.
4 Assignments
0 Petitions
Accused Products
Abstract
A method for performing an operation on a hierarchical data tree comprising retrieving data from an anchor node in the tree and a plurality of neighboring nodes each potentially affected by the operation. A cache is queried for a key representing the anchor node and the plurality of neighboring nodes based on the retrieved data. If the query finds a match, the retrieved data is replaced with cached data. If the query does not find a match, the operation is performed on the retrieved data to generate post-operation data, the retrieved data is replaced with the post-operation data and the post-operation data is stored in the cache based on the key.
-
Citations
54 Claims
-
1. A method for performing an operation on a hierarchical data tree, comprising:
-
visiting an anchor node in the tree;
retrieving data from the anchor node and a plurality of neighboring nodes each potentially affected by the operation;
querying a cache for a key representing the anchor node and the plurality of neighboring nodes in a pre-operation condition based on the retrieved data, wherein the cache stores pre-operation/post-operation data pairs;
if the query finds a match, replacing the pre-operation retrieved data with cached post-operation data; and
if the query does not find a match, performing the operation on the pre-operation retrieved data to generate post-operation data, replacing the pre-operation retrieved data with the post-operation data and storing the post-operation data in the cache with the associated pre-operation retrieved data. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26)
-
-
27. A processing system for performing an operation on a hierarchical data tree, comprising:
-
means for retrieving data from an anchor node in the tree and a plurality of neighboring nodes affected by the operation;
means for querying a cache for a key representative of the anchor node and the plurality of neighboring nodes based on the retrieved data;
means for replacing the retrieved data with cached data if the query finds a match; and
means for performing the operation on the retrieved data to generate post-operation data, replacing the retrieved data with the post-operation data and storing the post-operation data in the cache based on the key if the query does not find a match. - View Dependent Claims (28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38)
-
-
39. A program product, comprising:
-
a computer-readable storage medium;
means recorded on the medium for retrieving data from an anchor node in the tree and a plurality of neighboring nodes affected by the operation;
means recorded on the medium for querying a cache for a key representative of the anchor node and the plurality of neighboring nodes based on the retrieved data;
means recorded on the medium for replacing the retrieved data with cached data if the query finds a match; and
means recorded on the medium for performing the operation on the retrieved data to generate post-operation data, replacing the retrieved data with the post-operation data and storing the post-operation data in the cache based on the key if the query does not find a match. - View Dependent Claims (40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53)
-
-
54. A method for performing an operation on a hierarchical data tree, comprising:
-
retrieving data from an anchor node in the tree and a plurality of neighboring nodes each potentially affected by the operation;
querying a cache for a key representing the anchor node and the plurality of neighboring nodes based on the retrieved data;
if the query finds a match, replacing the retrieved data with cached data; and
if the query does not find a match, performing the operation on the retrieved data to generate post-operation data, replacing the retrieved data with the post-operation data and storing the post-operation data in the cache based on the key.
-
Specification