CONCERTO predicts query latency on parallel OLAP databases by estimating per-operator costs, calibrating resource contention with graph attention networks, and aggregating calibrated costs with a tree convolutional network.
Robust Estimation of Resource Consumption for SQL Queries using Statistical Techniques
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The ability to estimate resource consumption of SQL queries is crucial for a number of tasks in a database system such as admission control, query scheduling and costing during query optimization. Recent work has explored the use of statistical techniques for resource estimation in place of the manually constructed cost models used in query optimization. Such techniques, which require as training data examples of resource usage in queries, offer the promise of superior estimation accuracy since they can account for factors such as hardware characteristics of the system or bias in cardinality estimates. However, the proposed approaches lack robustness in that they do not generalize well to queries that are different from the training examples, resulting in significant estimation errors. Our approach aims to address this problem by combining knowledge of database query processing with statistical models. We model resource-usage at the level of individual operators, with different models and features for each operator type, and explicitly model the asymptotic behavior of each operator. This results in significantly better estimation accuracy and the ability to estimate resource usage of arbitrary plans, even when they are very different from the training instances. We validate our approach using various large scale real-life and benchmark workloads on Microsoft SQL Server.
citation-role summary
citation-polarity summary
fields
cs.DB 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
CONCERTO: Complex Query Execution Mechanism-Aware Learned Cost Estimation
CONCERTO predicts query latency on parallel OLAP databases by estimating per-operator costs, calibrating resource contention with graph attention networks, and aggregating calibrated costs with a tree convolutional network.