Dynamic partitioning of a data structure
US9286339B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 30, 2012 |
| Grant date | Mar 15, 2016 |
| Priority date | — |
| Expiry date | Apr 26, 2033 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2343
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.