Fast lookup of related data partitioned across a distributed key-value store
US10452610B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 31, 2017 |
| Grant date | Oct 22, 2019 |
| Priority date | — |
| Expiry date | Feb 16, 2038 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/182
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A storage cluster includes a plurality of key-value storage nodes categorized into sub-groups of data associated with a first value identifying the sub-group and second values identifying respective subsets of data. A key-value processing system receives at least one of a first request to retrieve a selected one of the sub-groups of data, the first request including a plurality of keys, each of the plurality of keys including the first value and a respective one of the second values, and a second request to retrieve a selected one of the subsets of data. The second request includes a key having the first value and a selected one of the second values. The selected one of the second values corresponds to a hash value. The storage cluster selectively provides at least one of the selected one of the sub-groups of data and the selected one of the subsets of data.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.