Zum Inhalt
Fakultät für Informatik
Publication at DaMoN 2023

Towards Data-Based Cache Optimization of B+-Trees


Towards Data-Based Cache Optimization of B+-Trees


Roland Kühn, Daniel Biebert, Christian Hakert, Jian-Jia Chen, and Jens Teubner


Proc. of the 19th Int'l Workshop on Data Management on Modern Hardware (DaMoN), Seattle, WA, USA, June 2023


The rise of in-memory databases and systems with considerably large memories and cache sizes requires the rethinking of the proper implementation of index structures like B+-trees in such systems. While disk block-sized nodes and binary search were considered as good in the past, smaller node sizes and cache-friendly linear search within nodes can be noticeably more performant nowadays. Considering the probabilistic distribution of lookup values to the B+-tree as part of a memory-friendly and cache-aware layout is a consequent next step, which is studied in this paper. Favoring frequently visited nodes and paths in the regard of cache hits can improve the overall performance of the tree and, thus, of the entire database system. We provide such an optimized B+-tree layout, which takes the probabilistic distribution of the lookup values as a basis. Experimental evaluation shows that choosing rather small node sizes in combination with our optimization algorithm can improve the performance by up to 26 % in comparison to a default baseline.




10.1145/3592980.3595316 (ACM Digital Library)

Publication Log

May 2023

camera-ready version (PDF)

March 2023

Submission to DaMoN 2023 (accept)