Robust Performance of Main Memory Data Structures by Configuration
Tiemo Bang, Ismail Oukid, Norman May, Ilia Petrov, Carsten Binnig
2020年份
6被引次数
3顶会引用
摘要
In this paper, we present a new approach for achieving robust performance of data structures making it easier to reuse the same design for different hardware generations but also for different workloads. To achieve robust performance, the main idea is to strictly separate the data structure design from the actual strategies to execute access operations and adjust the actual execution strategies by means of so-called configurations instead of hard-wiring the execution strategy into the data structure. In our evaluation we demonstrate the benefits of this configuration approach for individual data structures as well as complex OLTP workloads.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper3
- MxTasks: How to Make Efficient Synchronization and Prefetching EasyJan Mühlig, Jens TeubnerSIGMOD 2021 · 被引用 11 次
- P-MOSS: Scheduling Main-Memory Indexes Over NUMA Servers Using Next Token PredictionYeasir Rayhan, Walid G. ArefSIGMOD 2026 · 被引用 1 次
- Tabular: Efficiently Building Efficient IndexesZiyi Yan, Mohamed Farouk Drira, Tianxun Hu, Tianzheng WangVLDB 2025
相关 Paper
- P4DB - The Case for In-Network OLTPMatthias Jasny, Lasse Thostrup, Tobias Ziegler, Carsten BinnigSIGMOD 2022 · 被引用 18 次
- Rethink Query Optimization in HTAP DatabasesHaoze Song, Wenchao Zhou, Feifei Li, Xiang Peng 等SIGMOD 2024 · 被引用 7 次
- Dynamic read & write optimization with TurtleKVTony Astolfi, Vidya Silai, Darby Huye, Lan Liu 等VLDB 2026
- White-Box Micro-Adaptive Query ProcessingJack Pearce, Hubert Mohr-Daurat, Holger PirkICDE 2025
- Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in a Colossal Configuration SpaceJunfeng Liu, Fan Wang, Dingheng Mo, Siqiang LuoSIGMOD 2024 · 被引用 13 次
