Back to results
US 9,286,339 B2Granted
Dynamic partitioning of a data structure
AssigneeHewlett Packard Enterprise Development LP
InventorsEric A Anderson, Joseph A Tucek
Life of this patent
Estimating the term…
Abstract
A method for dynamically partitioning a B-tree data structure, includes: determining if the B-tree data structure requires a partition; establishing a midpoint of the B-tree data structure; migrating from a beginning of the B-tree data structure to the midpoint of the B-tree data structure to a first B-tree data structure; migrating from the midpoint of the B-tree data structure to an end of the B-tree data structure to a second B-tree data structure; and allowing normal operations on the B-tree data structure during migration.
Claims5
A method comprising:
- determining if a B-tree data structure requires a partition;
- migrating the B-tree data structure to a first B-tree data structure and a second B-tree data structure, wherein the migrating is performed without taking any locks;
- storing in a cache normal operations applied to the B-tree data structure during the migration;
- verifying the migration of the first B-tree data structure and the second B-tree data structure based on the B-tree data structure;
- and
- performing additional operations based on the verification, wherein the additional operations comprise updating the first B-tree data structure and the second B-tree data structure based on the cache.
3 more elements
Dependencies are inferred from the claim text.