Self-balancing tree data structure compression
US10169387B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 28, 2016 |
| Grant date | Jan 1, 2019 |
| Priority date | — |
| Expiry date | Jul 23, 2037 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/405
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A data element to be inserted into a memory data structure, represented by a key and a value, is received. A target node into which the received data element is to be inserted is determined based on the key of the received data element. A determination is made whether or not the target node is already compressed. An append-write operation to insert the data element into the target node is performed when the target node is already compressed. An evaluation is performed prior to inserting the data element when the target node is not already compressed. An in-place write operation to insert the data element into the uncompressed target node is performed when the evaluation generates a first result. The target node is compressed and then an append-write operation to insert the data element into the compressed target node is performed when the evaluation generates a second result.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.