Accelerating Persistent Memory-based Indices Based on Hotspot Data

Abstract

Non-volatile memory(NVM),also known as persistent memory(PM),has the characteristics of bit-based addressing,durability,high storage density and low latency.Although the latency of NVM is much smaller than that of solid-state drives,it is greater than that of DRAM.In addition,NVM has shortcomings such as unbalanced reading and writing as well as short writing life.Therefore,currently NVM cannot completely replace DRAM.A more reasonable method is using NVM to build a hybrid memory architecture based on DRAM+NVM.Based on the observation that many data accesses in database applications are skewed,this paper focuses on the hybrid memory architecture composed of NVM and DRAM and proposes a hotspot data-based speedup method for persistent memory indices.Particularly,we utilize the low latency of DRAM and the durability and high sto-rage density of NVM,and propose to add a DRAM-based hotspot-data cache for persistent memory indices.Then,we present a query-adaptive indexing method that can automatically adjust the cache according to the change of hotspot data.We apply the proposed method to several persistent memory indices,including wBtree,FPTree and Fast&Fair,and conduct comparative experiments.The results show that when the number of hotspot data visits accounts for 80% of the total visits,the proposed method can accelerate the query performance of the three indices by 52%,33% and 37%,respectively.

Keywords

• non-volatile memory|hybrid memory architecture|hotspot data|adaptive index