Staging anchor trees for improved concurrency and performance in page range index management
US11487734B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jun 30, 2017 |
| Grant date | Nov 1, 2022 |
| Priority date | — |
| Expiry date | Apr 14, 2038 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/27
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A distributed storage system includes non-volatile storage storing portions of a first object. The first object encompasses data having a first range of addresses and each portion includes data for a respective range of addresses that is a proper subset of the first range. A first data structure stores, for each portion, data indicating the respective range of addresses and a pointer to where the portion is stored. The first data structure includes a root tree and a set of trees ordered by creation data such that a last tree is most-recently created. The non-volatile storage stores received write data and a write buffer stores index data pointing to storage locations of the received write data. An index management system stores the index data from the write buffer into the last tree and, if the ordered set is empty, creates a tree in the ordered set before the storing.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.