Read iterator for pre-fetching nodes of a B-tree into memory
US11487731B2 · kind B2 · utility
0Cited by
3References
18Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jul 16, 2020 |
| Grant date | Nov 1, 2022 |
| Priority date | — |
| Expiry date | Oct 16, 2040 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2365
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Embodiments described herein are related to a method of scanning a B-tree. For example, a method comprises receiving a scan request to scan a B-tree having a plurality of levels, each level comprising one or more nodes, wherein for each of one or more levels of the plurality of levels, nodes are grouped into groups, where nodes of any given group are stored across sequential disk blocks. The method further comprises generating a queue for each level of the B-tree. For each queue, the method further comprises loading into memory a next group of nodes based upon determining a storage location of a node of the next group of nodes.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.