Big Data Research ›› 2021, Vol. 7 ›› Issue (6): 78-88.doi: 10.11959/j.issn.2096-0271.2021062

• STUDY • Previous Articles     Next Articles

A survey of persistent index data structures on non-volatile memory

Yongfeng WANG, Zhiguang CHEN   

  1. School of Computer Science and Engineering, Sun Yat-Sen University, Guangzhou 510006, China
  • Online:2021-11-15 Published:2021-11-01
  • Supported by:
    The National Key Research and Development Program of China(2018YFB0203904);The National Natural Science Foundation of China(61872392);The National Natural Science Foundation of China(61832020);The National Natural Science Foundation of China(U1811461);Pearl River S & T Nova Program of Guangzhou(201906010008);Guangdong Natural Science Foundation(2018B030312002)


With non-volatile memory becoming commercially available, the design and implementation of traditional storage systems need a fundamental change since they can not fully utilize the performance of non-volatile memory.To build a highthroughput, low-latency, large-scale storage system, there is an urgent need for efficient persistent index data structures that adapt to the characteristics of non-volatile memory.In terms of persistent index data structures, the optimizations applied for B+-Tree and Hash Table on non-volatile memory were summarized, and the pros and cons among these schemes were compared.And the future research directions with the challenges and opportunities that need to be resolved were showed.

Key words: storage system, non-volatile memory, persistent index data structure, performance optimization

CLC Number: 

No Suggested Reading articles found!