Data management method and system based on LSM tree storage structure and medium

By dynamically adjusting the merging operations of memory tables and execution hierarchy strategies in the LSM tree storage structure, the problems of load adaptability and transaction coordination of the LSM tree storage structure in distributed databases are solved, optimizing read efficiency and system stability, and preventing resource exhaustion and transaction isolation violations.

CN122412418APending Publication Date: 2026-07-17

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Filing Date
2026-04-24
Publication Date
2026-07-17

AI Technical Summary

Technical Problem

Existing LSM tree storage structures lack load adaptability in distributed databases, have limited resource monitoring dimensions, lack transaction coordination, and affect transaction isolation during disk flushing and merging operations, making it difficult to accurately reconstruct transaction states during crash recovery.

Method used

By determining whether the capacity or write pressure of the memory table has reached the freeze threshold, the memory table is converted into a read-only immutable structure. A new memory table is created to receive write operations, and the data is persisted in key order as the lowest-level file of the LSM tree storage structure. Indexes and fast query filters are generated, merge operations are performed according to the hierarchical strategy, historical version data is cleaned up, and I/O throttling mechanism is used to control the bandwidth of the merge operation.

Benefits of technology

It optimizes read efficiency, controls read amplification and storage amplification, improves the long-term stability of the system, prevents compaction storms and resource exhaustion, and ensures transaction isolation and system reliability.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122412418A_ABST
    Figure CN122412418A_ABST
Patent Text Reader

Abstract

本申请涉及一种基于LSM树存储结构的数据管理方法、系统及介质,本申请通过判断内存表的容量或写入压力是否达到冻结阈值,若是,将所述内存表转换为只读的不可变结构,并创建新的内存表以继续接收后续写入操作;将所述不可变结构按键有序持久化为LSM树存储结构的最底层存储文件,同时生成索引以及快速查询过滤器;按层级策略对所述LSM树存储结构的存储文件执行合并操作,其中,所述层级策略包括所述最底层保持键范围重叠而以上层级保持不重叠;在所述合并操作的过程中,基于系统活跃事务时间戳清理历史版本数据以及墓碑标记。通过合并操作重建有序性,优化读取效率,提高系统长期运行稳定性。
Need to check novelty before this filing date? Find Prior Art