mlsanityData to 7 Oct 2026

Are We Ready For Learned Cardinality Estimation?

arXiv 2012.06743 ↗First posted 12 Dec 2020cs.DB cs.LGcited by 19

Not on the map. Why?

Abstract (arXiv)

Cardinality estimation is a fundamental but long unresolved problem in query optimization. Recently, multiple papers from different research groups consistently report that learned models have the potential to replace existing cardinality estimators. In this paper, we ask a forward-thinking question: Are we ready to deploy these learned cardinality models in production? Our study consists of three main parts. Firstly, we focus on the static environment (i.e., no data updates) and compare five new learned methods with eight traditional methods on four real-world datasets under a unified workload setting. The results show that learned models are indeed more accurate than traditional methods, but they often suffer from high training and inference costs. Secondly, we explore whether these learned models are ready for dynamic environments (i.e., frequent data updates). We find that they cannot catch up with fast data up-dates and return large errors for different reasons. For less frequent updates, they can perform better but there is no clear winner among themselves. Thirdly, we take a deeper look into learned models and explore when they may go wrong. Our results show that the performance of learned methods can be greatly affected by the changes in correlation, skewness, or domain size. More importantly, their behaviors are much harder to interpret and often unpredictable. Based on these findings, we identify two promising research directions (control the cost of learned models and make learned models trustworthy) and suggest a number of research opportunities. We hope that our study can guide researchers and practitioners to work together to eventually push learned cardinality estimators into real database systems.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Dec 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 3; 2023: 4; 2024: 4; 2025: 3; 2026: 3.

19 papers.

Sort:

  1. 2021Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluationcited by 30
  2. 2023Lero: A Learning-to-Rank Query Optimizercited by 26
  3. 2022Balsa: Learning a Query Optimizer Without Expert Demonstrationscited by 18
  4. 2021A Unified Transferable Model for ML-Enhanced DBMScited by 10
  5. 2024PRICE: A Pretrained Model for Cross-Database Cardinality Estimationcited by 8
  6. 2022Detect, Distill and Update: Learned DB Systems Facing Out of Distribution Datacited by 6
  7. 2023WISK: A Workload-aware Learned Index for Spatial Keyword Queriescited by 6
  8. 2022Learning to be a Statistician: Learned Estimator for Number of Distinct Valuescited by 4
  9. 2024Theoretical Analysis of Learned Database Operations under Distribution Shift through Distribution Learnabilitycited by 4
  10. 2023Kepler: Robust Learning for Faster Parametric Query Optimizationcited by 3
  11. 2023Duet: efficient and scalable hybriD neUral rElation undersTandingcited by 3
  12. 2024CAMAL: Optimizing LSM-trees via Active Learningcited by 1
7 more
  1. 2024CardOOD: Robust Query-driven Cardinality Estimation under Out-of-Distributioncited by 1
  2. 2025DistJoin: A Decoupled Join Cardinality Estimator based on Adaptive Neural Predicate Modulationcited by 1
  3. 2025Is it Bigger than a Breadbox: Efficient Cardinality Estimation for Real World Workloadscited by 1
  4. 2025CoLSE: A Lightweight and Robust Hybrid Learned Model for Single-Table Cardinality Estimation using Joint CDFcited by 0
  5. 2026MICRO: A Lightweight Middleware for Optimizing Cross-store Cross-model Graph-Relation Joins [Technical Report]cited by 0
  6. 2026Selectivity Estimation for Linear Queries via Online Learningcited by 0
  7. 2026Learning-Augmented Algorithms: Guarantees, Construction Mechanisms, and System-Level Implicationscited by 0