Neumann, ThomasGalindo-Legaria, CesarMarkl, VolkerSaake, GunterSattler, Kai-UweHackenbroich, GregorMitschang, BernhardHärder, TheoKöppen, Veit2018-10-242018-10-242013978-3-88579-608-4https://dl.gi.de/handle/20.500.12116/17356Query optimization is an essential ingredient for efficient query processing, as semantically equivalent execution alternatives can have vastly different runtime behavior. The query optimizer is largely driven by cardinality estimates when selecting execution alternatives. Unfortunately these estimates are largely inaccurate, in particular for complex predicates or skewed data. We present an incremental execution framework to make the query optimizer more resilient to cardinality estimation errors. The framework computes the sensitivity of execution plans relative to cardinality estimation errors, and if necessary executes parts of the query to remove uncertainty. This technique avoids optimization decisions based upon gross misestimation, and makes query optimization (and thus processing) much more robust. We demonstrate the effectiveness of these techniques on large real-world and synthetic data sets.enText/Conference Paper1617-5468