White-Box Micro-Adaptive Query Processing

Operator performance in in-memory data management systems (DMS) often suffers from micro-architectural hazards such as cache misses and branch mispredictions. While many operators have alternative implementations that are robust against such hazards, these generally perform worse when no hazards are...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Data engineering s. 2880 - 2893
Hlavní autori: Pearce, Jack, Mohr-Daurat, Hubert, Pirk, Holger
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 19.05.2025
Predmet:
ISSN:2375-026X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Operator performance in in-memory data management systems (DMS) often suffers from micro-architectural hazards such as cache misses and branch mispredictions. While many operators have alternative implementations that are robust against such hazards, these generally perform worse when no hazards are encountered. Unfortunately, hazards are caused by order-dependent data characteristics that query optimizers struggle to capture (e.g., sortedness, clusteredness) making a priori hazard-conscious optimization difficult. Additionally, statically optimized plans fail to adapt when data characteristics vary within a table. To address these problems, we propose a hazardadaptive approach to query execution. Through hardwareassisted runtime profiling of low-level metrics, operators dynamically adapt to "hazardous" data. We propose an architecture for hazard-adaptive operators and integrate our approach into a DMS. We demonstrate that using hazard-adaptive operators provides a \sim \mathbf{2-20} \times speedup across several TPC-H queries.
ISSN:2375-026X
DOI:10.1109/ICDE65448.2025.00216