Method and system for optimizing B + tree index performance based on persistent memory

A B+ tree and memory technology, applied in the field of database indexing, can solve the problems of index performance degradation, reduce the service life of persistent memory, large lock overhead, etc., and achieve the effect of reducing the number of refreshes, ensuring data consistency, and reducing lock overhead.

Active Publication Date: 2020-09-01
HUAZHONG UNIV OF SCI & TECH
View PDF3 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Aiming at the above defects or improvement needs of the prior art, the present invention provides a method and system for optimizing the performance of B+ tree index based on persistent memory. When it is applied to the persistent memory, the index performance will be greatly reduced, and the technical problem of reducing the service life of the persistent memory, and in the multi-threaded mode, the existing B+ tree index mechanism has a negative impact on the locking mechanism of the shared data. Technical issues with large lock overhead

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
  • Method and system for optimizing B + tree index performance based on persistent memory

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0028] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not constitute a conflict with each other.

[0029] The basic idea of ​​the present invention is to propose a method and system for optimizing the performance of a B+ tree index based on persistent memory, which reduces the insertion, deletion and update processes through additional writing to leaf nodes and a reverse delayed refresh strategy for internal nodes A large number of shifted writes caused by reordering in the index; through the...

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 method for optimizing B + tree index performance based on a persistent memory. A traditional B + tree index is designed according to the characteristics of a DRAM and a disk,the characteristics of long writing delay, limited writing times, inconsistent power-down data and the like of a persistent memory are not considered, and the performance of a direct migration indexcan be greatly reduced. In order to improve the index concurrency performance, reduce the writing frequency of a B + tree in a persistent memory and prolong the service life of the persistent memory,the method adopts an additional writing strategy for leaf nodes to perform delayed refreshing on internal nodes, and reduces a large amount of shift writes brought to maintenance of entry orderlinessin the insertion process; in order to further improve the indexing efficiency, lock-free search is adopted in internal nodes, multiple threads can access the same node at the same time, and the indexconcurrency is improved.

Description

technical field [0001] The invention belongs to the technical field of database indexing, and more specifically relates to a method and system for optimizing the performance of a B+ tree index based on a persistent memory. Background technique [0002] Due to its high node fan-out, balanced tree height and dynamic resizing, B+ tree index is suitable for random and sequential processing application environments, has efficient data access performance, and is widely used in database systems. [0003] However, the traditional B+ tree index has some defects that cannot be ignored: first, it is designed according to the characteristics of DRAM and disk, and does not consider the characteristics of persistent memory such as long write delay, limited write times, and power-off data inconsistency. There are a large number of additional write operations. If the traditional B+ tree index is directly applied to the persistent memory, the index performance will be greatly reduced and the...

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): G06F16/22G06F9/48
CPCG06F16/2246G06F9/4881Y02D10/00
Inventor 吴非谢长生马瑞祥董卜榕
Owner HUAZHONG UNIV OF SCI & TECH
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