Method for accelerating access to key value data storage based on log structure merging tree by utilizing double granularity
A data storage and dual-granularity technology, applied in structured data retrieval, database indexing, storage systems, etc., can solve the problem of high search costs, improve throughput, and alleviate cache failure problems
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0025] The method for using double granularity to accelerate access to key-value data storage based on log-structure merged tree provided by the present invention will be further described below with reference to the accompanying drawings.
[0026] The structure diagram of the log structure merge tree is as follows figure 1 As shown, the log-structure merge tree usually consists of two parts, one is the memory part and the other is the hard disk part. The memory structure is usually organized into an ordered structure in the form of a jump list or a B-tree, called layer 0, which is used to store key-value pairs recently written, updated, or deleted by the system. The size of layer 0 is usually relatively small. When its capacity reaches the set threshold, the key-value pairs stored in layer 0 will be written sequentially to the first layer of the hard disk structure (forming a file , call it a run). This operation is called a flush operation. The hard drive structure is org...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


