LSM-tree (The Log-Structured Merge-Tree) index optimization method and LSM-tree index optimization system
An optimization method and indexing technology, applied in the field of data processing, can solve problems such as excessive operations, reduced database throughput, and high consumption, and achieve the effects of reducing CPU consumption, avoiding memory overhead, and avoiding performance degradation
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
no. 1 example
[0034] figure 2 It is a flow chart of an LSM-tree index optimization method provided in the first embodiment of the present invention. The method of this embodiment can be executed by an LSM-tree index optimization device, which can be implemented by means of hardware and / or software Realized, and generally can be integrated in a server for storing massive LSM-tree index structure data, wherein, the server can be a single server, or a cluster server composed of multiple servers. Since the embodiment of the present invention has an obvious optimization effect for the scenario where the same Key data item is frequently updated, the server may preferably be a search engine server.
[0035] The method of this embodiment specifically includes:
[0036] 210. Store the data written in the memory according to the LSM-tree memory index structure.
[0037]In the traditional LSM-tree index structure, the data in the memory is usually stored in the form of a balanced tree or skip table...
no. 2 example
[0056] image 3 It is a flowchart of an LSM-tree index optimization method according to the second embodiment of the present invention. This embodiment is optimized on the basis of the above embodiments. In this embodiment, the data written in the memory is stored according to the LSM-tree memory index structure. The specific optimization is: when there is data written into the memory, the The data is stored in the bottom layer of the LSM-tree memory index structure, and the bottom layer is used as the current operation layer; according to the position of the current operation layer in the LSM-tree memory index structure, the acquisition and the current The merge threshold condition corresponding to the operation layer; when the data stored in the current operation layer meets the merge threshold condition, according to the second merge algorithm, the data stored in the current operation layer is merged; the merge result is stored in In the layer above the current operation l...
no. 3 example
[0074] Figure 4 It is a flow chart of an LSM-tree index optimization method according to the third embodiment of the present invention. This embodiment is optimized based on the above embodiments. In this embodiment, the LSM-tree memory index structure is specifically optimized to include three layers, which are respectively the zeroth layer, the first layer and the second layer from bottom to top. ;
[0075] Specifically optimizing the merging threshold condition of the zeroth layer is that the size of the data stored in the zeroth layer is greater than the first data threshold;
[0076] Specifically optimizing the merging threshold condition of the first layer is that the number of data blocks stored in the first layer is greater than the data block threshold.
[0077] Correspondingly, the method in this embodiment specifically includes:
[0078] 410. When data is written into the memory, store the data in the zeroth layer of the LSM-tree memory index structure.
[0079...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com