TY  - JOUR
A1  - Dreseler, Markus
A1  - Boissier, Martin
A1  - Rabl, Tilmann
A1  - Uflacker, Matthias
T1  - Quantifying TPC-H choke points and their optimizations
JF  - Proceedings of the VLDB Endowment
N2  - TPC-H continues to be the most widely used benchmark for relational OLAP systems. It poses a number of challenges, also known as "choke points", which database systems have to solve in order to achieve good benchmark results. Examples include joins across multiple tables, correlated subqueries, and correlations within the TPC-H data set. Knowing the impact of such optimizations helps in developing optimizers as well as in interpreting TPC-H results across database systems.
This paper provides a systematic analysis of choke points and their optimizations. It complements previous work on TPC-H choke points by providing a quantitative discussion of their relevance. It focuses on eleven choke points where the optimizations are beneficial independently of the database system. Of these, the flattening of subqueries and the placement of predicates have the biggest impact. Three queries (Q2, Q17, and Q21) are strongly ifluenced by the choice of an efficient query plan; three others (Q1, Q13, and Q18) are less influenced by plan optimizations and more dependent on an efficient execution engine.
Y1  - 2020
U6  - https://doi.org/10.14778/3389133.3389138
SN  - 2150-8097
VL  - 13
IS  - 8
SP  - 1206
EP  - 1220
PB  - Association for Computing Machinery
CY  - New York
ER  -