Data gravitation in a distributed-tree structure
First Claim
Patent Images
1. A computer-implemented method for obtaining data from a cluster of cache nodes in a tree-based structure, the method comprising:
- receiving a query for data of a cache node of a partition group from a querying cache node outside the partition group, the partition group comprising one or more cache nodes of the cluster, wherein an instance of a cache node in the partition group is copied to each cache node in the partition group;
copying the instance of the data of the cache nodes of the partition group to the querying cache node;
adjusting the partition group to include the querying cache node as a member of the partition group; and
adjusting the membership size of the partition group based on a partition maintenance thread of the one or more node caches of the partition group,wherein the partition maintenance thread comprises a hard upper membership size limit, a soft upper membership size limit, a hard lower membership size limit, a soft lower membership size limit, the limits defining how many copies of each data element can exist in the partition group.
1 Assignment
0 Petitions
Accused Products
Abstract
A method and apparatus for obtaining data from a cluster of cache nodes in a tree-based structure is disclosed. A querying cache node outside a partition group queries data of a cache node of the partition group. The partition group is made of one or more cache nodes of the cluster, where an instance of a cache node in the partition group is copied to each cache node in the partition group. The instance of the data of the cache nodes of the partition group is copied to the querying cache node. The partition group is adjusted to include the querying cache node as a member of the partition group.
-
Citations
18 Claims
-
1. A computer-implemented method for obtaining data from a cluster of cache nodes in a tree-based structure, the method comprising:
-
receiving a query for data of a cache node of a partition group from a querying cache node outside the partition group, the partition group comprising one or more cache nodes of the cluster, wherein an instance of a cache node in the partition group is copied to each cache node in the partition group; copying the instance of the data of the cache nodes of the partition group to the querying cache node; adjusting the partition group to include the querying cache node as a member of the partition group; and adjusting the membership size of the partition group based on a partition maintenance thread of the one or more node caches of the partition group, wherein the partition maintenance thread comprises a hard upper membership size limit, a soft upper membership size limit, a hard lower membership size limit, a soft lower membership size limit, the limits defining how many copies of each data element can exist in the partition group. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. An apparatus for obtaining data from a cluster of cache nodes in a tree-based structure comprising:
-
a storage device comprising the cluster of cache nodes in a tree-based structure; and a processing device coupled to the storage device, the processing device configured to receive a query for data of a cache node of a partition group from a querying cache node outside the partition group, the partition group comprising one or more cache nodes of the cluster, wherein an instance of a cache node in the partition group is copied to each cache node in the partition group, to copy the instance of the data of the cache nodes of the partition group to the querying cache node, to adjust the partition group to include the querying cache node as a member of the partition group, and to adjust the membership size of the partition group based on a partition maintenance thread of the one or more node caches of the partition group, wherein the partition maintenance thread comprises a hard upper membership size limit, a soft upper membership size limit, a hard lower membership size limit, a soft lower membership size limit, the limits defining how many copies of each data element can exist in the partition group. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. A non-transitory computer-readable storage medium, having instructions stored therein, which when executed, cause a computer system to perform a method comprising:
-
receiving a query for data of a cache node of a partition group from a querying cache node outside the partition group, the partition group comprising one or more cache nodes of the cluster, wherein an instance of the cache node in the partition group is copied to each cache node in the partition group; copying the instance of the data of the cache nodes of the partition group to the querying cache node; and adjusting the partition group to include the querying cache node as a member of the partition group, adjusting the membership size of the partition group based on a partition maintenance thread of the one or more node caches of the partition group, wherein the partition maintenance thread comprises a hard upper membership size limit, a soft upper membership size limit, a hard lower membership size limit, a soft lower membership size limit, the limits defining how many copies of each data element can exist in the partition group. - View Dependent Claims (14, 15, 16, 17, 18)
-
Specification