Leveraging hierarchy in a tree data structure to dynamically allocate keys
US10067966B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 29, 2015 |
| Grant date | Sep 4, 2018 |
| Priority date | — |
| Expiry date | Sep 27, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/9027
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques for dynamically allocating keys in an instance of a tree data structure are provided. In one embodiment, a computer system can, at a time of instantiating each non-root node in the instance, determine a key space to be addressed by the non-root node, where the key space is based on a key subinterval in a parent node of the non-root node that is associated with a pointer to the non-root node. The computer system can further calculate a number of bits to allocate to each key of the non-root node in view of the determined key space. The computer system can then allocate the keys of the non-root node in accordance with the calculated number of bits.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.