Variance aware optimization of parameterized queries

Citations Over TimeTop 10% of 2010 papers

Abstract

Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter values. In today's DBMSs the query optimizer typically chooses a single execution plan that is reused for multiple instances of the same query. A key problem is that even if a plan with low average cost across instances is chosen, its variance can be high, which is undesirable in many production settings. In this paper, we describe techniques for selecting a plan that can better address the trade-off between the average and variance of cost across instances of a parameterized query. We show how to efficiently compute the skyline in the average-variance cost space. We have implemented our techniques on top of a commercial DBMS. We present experimental results on benchmark and real-world decision support queries.

Related Papers

• → Query optimization over crowdsourced data(2013)47 cited
• → Cost-Based Query Optimization in Centralized Relational Databases(2019)2 cited
• → Distributed Query Plan Generation using Ant Colony Optimization(2015)12 cited
• → Distributed Query Engine for Multiple-Query Optimization over Data Stream(2019)2 cited
• → Learned Query Superoptimization(2023)1 cited