Reduced bandwidth queries in B e-trees using approximate membership query data structures
US11720568B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 20, 2018 |
| Grant date | Aug 8, 2023 |
| Priority date | — |
| Expiry date | Sep 27, 2039 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2462
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Exemplary methods, apparatuses, and systems include a file system process reading a first node in a tree data structure from a first memory. The first node includes a first approximate membership query data structure (“AMQ”), a first plurality of child pointers, a first plurality of pivot values, and a first buffer. The file system process determines that the first plurality of child pointers exceeds a maximum size. Using a pivot value in the first plurality of pivot values, the file system process splits the first node into a second node and a third node. The file system process uses the pivot value to split the first buffer into a second buffer and a third buffer. Using the pivot value and the first AMQ, the file system process generates a second AMQ and a third AMQ.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.