Cost Modelling for Optimal Data Placement in Heterogeneous Main Memory
Robert Lasch, Thomas Legler, Norman May, Bernhard Scheirle, Kai-Uwe Sattler
Abstract
The cost of DRAM contributes significantly to the operating costs of in-memory database management systems (IMDBMS). Persistent memory (PMEM) is an alternative type of byte-addressable memory that offers --- in addition to persistence --- higher capacities than DRAM at a lower price with the disadvantage of increased latencies and reduced bandwidth. This paper evaluates PMEM as a cheaper alternative to DRAM for storing table base data, which can make up a significant fraction of an IMDBMS' total memory footprint. Using a prototype implementation in the SAP HANA IMDBMS, we find that placing all table data in PMEM can reduce query performance in analytical benchmarks by more than a factor of two, while transactional workloads are less affected. To quantify the performance impact of placing individual data structures in PMEM, we propose a cost model based on a lightweight workload characterization. Using this model, we show how to place data pareto-optimally in the heterogeneous memory. Our evaluation demonstrates the accuracy of the model and shows that it is possible to place more than 75% of table data in PMEM while keeping performance within 10% of the DRAM baseline for two analytical benchmarks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1022bbed-3da6-4c61-96c4-4c5ce1a30e16Cited by top-tier papers4
- A Design Space Exploration and Evaluation for Main-Memory Hash Joins in Storage Class MemoryWentao Huang, Yunhong Ji, Xuan Zhou, Bingsheng He et al.VLDB 2023 · 9 citations
- Towards Optimizing Storage Costs on the CloudKoyel Mukherjee, Raunak Shah, Shiv Kumar Saini, Karanpreet Singh et al.ICDE 2023 · 8 citations
- Object-oriented Unified Encrypted Memory Management for Heterogeneous Memory ArchitecturesMo Sha, Yifan Cai, Sheng Wang, Linh Thi Xuan Phan et al.SIGMOD 2024 · 8 citations
- TierBase: A Workload-Driven Cost-Optimized Key-Value StoreZhitao Shen, Shiyu Yang, Weibo Chen, Kunming Wang et al.ICDE 2025
Builds on8
- An Empirical Guide to the Behavior and Use of Scalable Persistent MemoryJian Yang, Juno Kim, Morteza Hoseinzadeh, Joseph Izraelevitz et al.FAST 2020 · 470 citations
- Quantifying TPC-H Choke Points and Their OptimizationsMarkus Dreseler, Martin Boissier, Tilmann Rabl, Matthias UflackerVLDB 2020 · 91 citations
- LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint MemoryJihang Liu, Shimin Chen, Lujun WangVLDB 2020 · 69 citations
- Rethinking Logging, Checkpoints, and Recovery for High-Performance Storage EnginesMichael Haubenschild, Caetano Sauer, Thomas Neumann, Viktor LeisSIGMOD 2020 · 43 citations
- Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile MemoryXinjing Zhou, Joy Arulraj, Andrew Pavlo, David E. CohenSIGMOD 2021 · 42 citations
Related papers
- Maximizing Persistent Memory Bandwidth Utilization for OLAP WorkloadsBjörn Daase, Lars Jonas Bollmeier, Lawrence Benson, Tilmann RablSIGMOD 2021 · 38 citations
- PerMA-Bench: Benchmarking Persistent Memory AccessLawrence Benson, Leon Papke, Tilmann RablVLDB 2022 · 19 citations
- NVM: Is it Not Very Meaningful for Databases?Dimitrios Koutsoukos, Raghav Bhartia, Michal Friedman, Ana Klimovic et al.VLDB 2023 · 9 citations
- Viper: An Efficient Hybrid PMem-DRAM Key-Value StoreLawrence Benson, Hendrik Makait, Tilmann RablVLDB 2021 · 86 citations
- XPGraph: XPline-Friendly Persistent Memory Graph Stores for Large-Scale Evolving GraphsRui Wang, Shuibing He, Weixu Zong, Yongkun Li et al.MICRO 2022 · 21 citations
