Invention Grant
- Patent Title: Dynamically slicing datastore query sizes
-
Application No.: US15948638Application Date: 2018-04-09
-
Publication No.: US11314739B2Publication Date: 2022-04-26
- Inventor: Robert Birke , Navaneeth Rameshan , Yiyu Chen , Martin Schmatz
- Applicant: International Business Machines Corporation
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Cantor Colburn LLP
- Agent Daniel Morris
- Main IPC: G06F16/2453
- IPC: G06F16/2453 ; G06F16/22

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.
Public/Granted literature
- US20190311056A1 DYNAMICALLY SLICING DATASTORE QUERY SIZES Public/Granted day:2019-10-10
Information query