Storage method suitable for key value pair data

Abstract

The invention discloses a storage method suitable for key value pair data. The method comprises the following steps of: aiming at data characteristics of an LSM-tree structure, carrying out flat management on storage equipment, and respectively carrying out processing according to different characteristics of a log request and a data table request of the LSM-tree structure: storing the log request to a specific log area by using a small-granularity IO unit, and storing the data table request in a continuous physical space; assigning an id of a data table according to a storage physical space segment serial number; and during key value reading, searching the id of the data table according to meta information of the LSM-tree structure, and positioning a physical storage position of the data table according to the id. According to the storage method, the index from the id of the data table to the storage position thereof is simplified, so that LSM-tree data keeps the characteristic of continuity in a physical storage layer; and a writing operation does not need to change extra far-end index information, and the data table is stored in a compact manner, so that a deletion operation can recover the whole storage segment without carrying out extra migration and replication operations.

Description

technical field [0001] The invention belongs to the technical field of data storage, and more specifically relates to a method for storing key-value pair data. Background technique [0002] Key-value (Key-Value, KV) data has been widely used in recent years, and the KV system based on log merge tree (LSM-tree) is suitable for occasions with frequent writes. KV applications based on the LSM-tree structure usually maintain a level 0 table in memory. When the level 0 table is full, it is merged into the level 1 table. If the total size or number of tables in the level 1 table exceeds the set value, select Merge into level 2 tables, and so on; this structure implements deletion operations through insertion and deletion; since the data is always read from level 0 downwards, the newly inserted data will shield the old ones when reading Data; if the delete character is read, it indicates that the data has been deleted. [0003] Traditional KV applications run on the file system. ...

AI Technical Summary

Problems solved by technology

[0006] Aiming at the above defects or improvement needs of the prior art, the present invention provides a storage method suitable for key-value pair data, the purpose of which is to use the serial number of the data table file to address the physical device, eliminating the need for path index, thus solving the problem of logically continuous data being discontinuous in physical storage

Images