Method of high-speed concurrent processing of user requests of Key-Value database

Abstract

The invention discloses a method of high-speed concurrent processing of user requests of a Key-Value database. The method of the high-speed concurrent processing of the user requests of the Key-Value database comprises the steps of (1) receiving the user requests, and sequentially adding the user requests into a request buffering queue; (2) initializing a key code classification queuing list, continuously popping the user requests out from the request buffering queue according to a first-in first-out order, sorting the user requests to different pending processing queues according to different key codes of the user requests, and adding a mapping relation between the key codes and the pending processing queues into the key code classification queuing list; and (3) initializing a request assembly, continuously popping the user requests out on the head portion of the pending processing queues to the request assembly, using worker threads with a preset number to carry out concurrent processing on the user requests in the request assembly, and returning processing results to users. The method of the high-speed concurrent processing of the user requests of the Key-Value database has the advantages of being high in concurrent processing fine grit, good in concurrent processing capacity, high in use ratio of hardware resources, balanced in load of all processor cores in a multi-core processor, and capable of ensuring sequence among read-write dependent requests.

Description

technical field [0001] The invention relates to the field of Key-Value databases, in particular to a high-speed concurrent processing method for Key-Value database user requests. Background technique [0002] Different from the SQL database, the Key-Value database is used to store unstructured key-value data, that is, the key code (ie Key) is used as an index to read, write, and delete the data record (ie Value) corresponding to the Key. Since the Key-Value database only cares about the process of indexing the Value through the Key, and does not care about the structure and content of the specific data stored in the Value, compared with the SQL database, it has more specific functions, faster access speed, and better horizontal scalability. [0003] Usually, the request processing process of the Key-Value database is divided into two parts: the front-end and the back-end: the front-end request processing process that receives requests through I / O input interfaces such as the...

AI Technical Summary

Problems solved by technology

[0005] 1) On a multi-core processing platform, the workload may be unbalanced among the computing cores

Because different user connections generate Key-Value data requests at different rates, the processing threads corresponding to each connection have different degrees of idleness, which eventually leads to different workloads of each computing core when the database is running on a multi-core processing platform.

[0006] 2) The potential concurrency of Key-Value data requests sent by the same connection has not been fully exploited

This is because even for requests sent by the same user connection, there is no dependency between the read and write requests for Key1 and the read and write requests for Key2, so they can be executed concurrently. However, the existing system cannot effectively exploit such concurrent features.

Images