面向非易失性内存的持久索引数据结构研究综述

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

随着非易失性内存从理论走向实用,现代存储系统的设计与实现将迎来颠覆性变革。针对传统存储设备设计的存储系统并不能充分利用非易失性内存带来的性能红利。为了构建高吞吐、低时延、大规模的存储系统,迫切需要设计与非易失性内存硬件特性相匹配的持久索引数据结构,从而进一步提升性能。从持久索引数据结构出发,分别对B+-Tree和哈希表在非易失性内存上的设计和优化进行分析,比较其优缺点,并展望了该方向的机遇与面临的挑战。

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 high-throughput,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.