Time slice rotation mechanism based tree storage structure write amplification optimization method

A technology of tree-like storage and optimization method, applied in the input/output process of data processing, instruments, electrical and digital data processing, etc., can solve the problems of data retention, write amplification, affecting performance, etc. The effect of throughput improvement

Active Publication Date: 2016-04-13
INST OF INFORMATION ENG CHINESE ACAD OF SCI
View PDF6 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The existing LSM-Tree merge selection priority mechanism has flaws, and it cannot guarantee that the data of each component will move smoothly to the lower component. Once the amount of data increases, the data will be stuck in a certain component, resulting in a large write amplification when the component is merged. , affecting the overall performance of

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Time slice rotation mechanism based tree storage structure write amplification optimization method

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0037] Example 1 A write amplification optimization method for tree-like storage structure based on the time slice rotation mechanism

[0038] The present invention is implemented and tested based on RocksDB. The specific implementation method is as follows:

[0039] ① When the system is initialized, the occupation authority of the time slice is set to empty.

[0040] ② When there is a component (not necessarily a component that occupies a time slice) that satisfies the fact that the data volume of this component is greater than the threshold of this component, determine whether the current time slice is occupied by the component. If it is not occupied, execute ④; if it is already occupied, judge whether the component currently occupying the time slice satisfies that the data volume of this component is greater than the threshold of this component, if not, execute ③; if it is satisfied, judge the merge time of the component Whether the threshold of the current time slice has...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a time slice rotation mechanism based tree storage structure write amplification optimization method. The method comprises: 1) selecting a to-be-combined component in a disk space and endowing the component with a right of occupying a time slice, wherein the disk space adopts a multi-component tree storage structure; 2) according to a value of current data volume of the selected component, dynamically adjusting a threshold of the time slice; and 3) continuously performing multi-time combination operations on the selected component in the process of occupying the time slice. The method has a highest combination selection priority for components with time slices, and components incapable of being combined will automatically give up the time slices, so that idle system resources caused by unnecessary long-term occupation are avoided and the overall write throughput of LSM-Tree can be increased by more than 40%.

Description

technical field [0001] The invention belongs to the technical field of computer software, and relates to a write amplification optimization method of a tree-like storage structure based on a time slice rotation mechanism. Background technique [0002] LSMTree is a multi-component tree storage structure. Generally speaking, LSMTree consists of two parts: memory space and disk space. The data will first be cached in the memory space, and when the memory space reaches a certain threshold, the data in the memory will be flashed to the disk space in batches. Disk space is composed of multi-layer components, and each layer of components has a threshold for storing data size, and the threshold increases exponentially from top to bottom. The data that has just been flushed from the memory to the disk will be stored in the upper-level component first. When the data in the component reaches the threshold, the data in this layer will be merged into the lower-level component through t...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F3/06
CPCG06F3/0608G06F3/0613G06F3/0634
Inventor 岳银亮李宇哲王伟平
Owner INST OF INFORMATION ENG CHINESE ACAD OF SCI
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap