Dynamically slicing datastore query sizes
US11314739B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 9, 2018 |
| Grant date | Apr 26, 2022 |
| Priority date | — |
| Expiry date | Jul 26, 2040 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/22
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The present disclosure relates to a method of managing requests to a key-value database. A non-limiting example of the method includes receiving a request that includes a number of keys. The number of keys can be compared with a first threshold number and second threshold number. If the number of keys exceeds the first threshold number, the request can be split. If the number of keys is smaller than the second threshold number, the request can be merged with at least one previous or subsequent request. Requests resulting from the splitting and merging steps can be submitted to the key-value database for further processing of the submitted requests.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.