Efficient B-Tree data serialization
US10248676B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 28, 2016 |
| Grant date | Apr 2, 2019 |
| Priority date | — |
| Expiry date | Apr 20, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2272
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
B-Tree data is serialized to existing data for all types of workloads by converting a B-Tree data structure into a format capable of being stored and resurrected while containing all data stored in the B-Tree data structure and information relating to the B-Tree data structure. The serialized B-Tree data is divided into a plurality of sections. The serialized B-Tree data is stored into a plurality of buffers, where storing the B-Tree information section in a first binary buffer, the B-Tree key section in a second binary buffer, and the B-Tree data section in a third binary buffer. In the B-Tree data section, B-Tree data elements stored in the B-Tree data structure are saved, where a size of the B-Tree data section is equal to a total number of the B-Tree data elements in the B-Tree data structure multiplied by a size of each of the B-Tree data elements.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.