Prof. Dr. h.c. mult. Hasso Plattner


"Quantifying TPC-H Choke Points and Their Optimizations" published in PVLDB

In our latest paper, we quantify the importance of eleven query plan optimizations for the TPC-H benchmark. Knowing which optimizations have the biggest impact helps in interpreting benchmark results as well as when developing a new DBMS from scratch. Please find the paper and feel free to contact Markus Dreseler for questions and discussions.


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 influenced 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.