A kind of optimization method, device and computer equipment of LSM tree

Abstract

Disclosed are an LSM tree optimization method and device and a computer equipment, the method comprising: determining a target leaf node for which indicated data has already been deleted in an LSM tree; and adding a deletion tag for the target leaf node in dynamic data of the LSM tree.

Description

technical field [0001] The embodiments of this specification relate to the technical field of data processing, and in particular to a method, device and computer equipment for optimizing an LSM tree. Background technique [0002] The LSM tree (Log-Structured Merge Tree, log-structured merge tree) is a data structure based on a hard disk, which includes dynamic data and static data, and the dynamic data and static data store the modified increment of data. During the process of accessing the LSM tree, its dynamic data and static data are read sequentially, and the read results are combined to obtain the final read result. [0003] Since the LSM tree stores the modification increments of the data, when there are a large number of modification increments used to indicate that the data has been deleted in the LSM tree, it is necessary to traverse a large amount of useless data in the process of reading the data. Effective data is read, which also leads to a decrease in data rea...

AI Technical Summary

Problems solved by technology

[0003] Since the LSM tree stores the modification increments of the data, when there are a large number of modification increments used to indicate that the data has been deleted in the LSM tree, it is necessary to traverse a large amount of useless data in the process of reading the data. Valid data is read, which also leads to a decrease in data reading performance

Images