Efficient indexing method for optimizing leaf node merging operation

user-5f8cf9244c775ec6fa691c99(2020)

引用 0|浏览20
暂无评分
摘要
The invention discloses an efficient indexing method for optimizing leaf node merging operation. The method is characterized in that a new leaf node structure design and efficient in-situ merging operation suitable for the NVM are introduced. The method comprises the steps: dividing the index into a buffer B-tree stored in the DRAM and a base B-tree stored in the NVM; in the process of executing the write operation by indexing, firstly writing the write operation into a log file of a buffer B tree, and then modifying the buffer B tree; when the capacity of the buffer B tree exceeds a thresholdvalue, combining the buffer B tree into the basic B tree on the NVM through an in-situ merging operation by means of a basic B leaf node structure design, and efficiently persisting dirty data into the NVM through a WBINVD instruction; after the in-situ merging operation is finished, emptying the buffer B tree and the log files on the NVM to finish the indexing process of the write operation. Theindexing method can effectively reduce the writing frequency of the NVM, reduce the loss of the NVM and improve the writing performance.
更多
查看译文
关键词
Tree (data structure),B-tree,Dram,Search engine indexing,Dirty data,Parallel computing,Division (mathematics),Computer science,Merge (version control),Structure design
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要