Title: Is it Bigger than a Breadbox: Efficient Cardinality Estimation for Real World Workloads
Primary area: learning on graphs and other geometries & topologies
Keywords: Local regression, Graph Hashing, Cardinality Estimation, Cost Models, Databases, Query Optimization

Abstract: DB engines produce efficient query execution plans by relying on cost models. Practical implementations estimate cardinality of queries using heuristics, with magic numbers tuned to improve average performance on benchmarks. Empirically, estimation error significantly grows with query complexity. Alternatively, learning-based estimators offer improved accuracy, but add operational complexity preventing their adoption in-practice. Recognizing that query workloads contain highly repetitive subquery patterns, we learn many simple regressors online, each localized to a pattern. The regressor corresponding to a pattern can be randomly-accessed using hash of graph structure of the subquery. Our method has negligible overhead and competes with SoTA learning-based approaches on error metrics. Further, amending PostgreSQL with our method achieves notable accuracy and runtime improvements over traditional methods and drastically reduces operational costs compared to other learned cardinality estimators, thereby offering the most practical and efficient solution on the Pareto frontier. Concretely, simulating JOB-lite workload on IMDb speeds-up execution by 7.5 minutes (>30%) while incurring only 37 seconds overhead for online learning.

TL;DR: Cardinality Estimation (number of records that will be returned given a query) by many local regression models, one model per isomorphic group of graphs. Each graph corresponds to sub-query.