Capacity management for trees under multi-version concurrency control
US10776426B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 28, 2017 |
| Grant date | Sep 15, 2020 |
| Priority date | — |
| Expiry date | Jan 5, 2038 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/906
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Capacity management is provided for a plurality of search trees under multi-version concurrency control. A non-volatile memory includes a plurality of chunks that are fixed-sized blocks of the non-volatile memory, each chunk including at least one page. The non-volatile memory stores the plurality of search trees, each search tree having elements including a tree root, a tree node and a tree leaf. Each element of the tree is at a different level of the search tree: a first level including the tree root, a second level including the tree node, and a third level including the tree leaf. The plurality of chunks includes a number of chunk types, each chunk type for storing the element from a different level of the search tree, such that elements from different levels are stored in separate chunks.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.