Invention Grant
- Patent Title: Efficient B-Tree data serialization
-
Application No.: US15082785Application Date: 2016-03-28
-
Publication No.: US10248676B2Publication Date: 2019-04-02
- Inventor: Lilia Demidov , Nir Halowani , Yifat Kuttner , Ben Sasson
- Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Applicant Address: US NY Armonk
- Assignee: INTERNATIONAL BUSINESS MACHIENS CORPORATION
- Current Assignee: INTERNATIONAL BUSINESS MACHIENS CORPORATION
- Current Assignee Address: US NY Armonk
- Agency: Griffiths & Seaton PLLC
- Main IPC: G06F17/30
- IPC: G06F17/30

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.
Public/Granted literature
- US20160210319A1 EFFICIENT B-TREE DATA SERIALIZATION Public/Granted day:2016-07-21
Information query