Selective caching: a persistent memory approach for multi-dimensional index structures

被引:0
作者
Muhammad Attahir Jibril
Philipp Götze
David Broneske
Kai-Uwe Sattler
机构
[1] Technische Universität Ilmenau,
[2] OvG University Magdeburg,undefined
[3] German Centre For Higher Education Research And Science Studies (DZHW),undefined
来源
Distributed and Parallel Databases | 2022年 / 40卷
关键词
Persistent memory; Non-volatile memory; Index structures; Data management; Databases;
D O I
暂无
中图分类号
学科分类号
摘要
After the introduction of Persistent Memory in the form of Intel’s Optane DC Persistent Memory on the market in 2019, it has found its way into manifold applications and systems. As Google and other cloud infrastructure providers are starting to incorporate Persistent Memory into their portfolio, it is only logical that cloud applications have to exploit its inherent properties. Persistent Memory can serve as a DRAM substitute, but guarantees persistence at the cost of compromised read/write performance compared to standard DRAM. These properties particularly affect the performance of index structures, since they are subject to frequent updates and queries. However, adapting each and every index structure to exploit the properties of Persistent Memory is tedious. Hence, we require a general technique that hides this access gap, e.g., by using DRAM caching strategies. To exploit Persistent Memory properties for analytical index structures, we propose selective caching. It is based on a mixture of dynamic and static caching of tree nodes in DRAM to reach near-DRAM access speeds for index structures. In this paper, we evaluate selective caching on the OLAP-optimized main-memory index structure Elf, because its memory layout allows for an easy caching. Our experiments show that if configured well, selective caching with a suitable replacement strategy can keep pace with pure DRAM storage of Elf while guaranteeing persistence. These results are also reflected when selective caching is used for parallel workloads.
引用
收藏
页码:47 / 66
页数:19
相关论文
共 32 条
[1]  
Arulraj J(2018)BzTree: a high-performance latch-free range index for non-volatile memory PVLDB 11 553-565
[2]  
Levandoski J(2019)Efficient evaluation of multi-column selection predicates in main-memory IEEE TKDE 31 1296-1311
[3]  
Broneske D(2015)Persistent B+-trees in non-volatile main memory PVLDB 8 786-797
[4]  
Köppen V(2018)Data management on non-volatile memory: a perspective DB-Spektrum 18 171-182
[5]  
Chen S(2014)In-memory performance for big data Proc VLDB Endow 8 37-48
[6]  
Jin Q(2019)Evaluating persistent memory range indexes PVLDB 13 574-587
[7]  
Götze P(2020)LB+-trees: optimizing persistent index performance on 3DXPoint memory PVLDB 13 1078-1090
[8]  
van Renen A(2016)A survey of software techniques for using non-volatile memories for storage and main memory systems IEEE TPDS 27 1537-1550
[9]  
Graefe G(1992)Working with persistent objects: to swizzle or not to swizzle IEEE Trans. Softw. Eng. 18 657-673
[10]  
Volos H(2008)The missing memristor found Nature 453 80-83