mlsanityData to 14 Oct 2026

Data-Agnostic Cardinality Learning from Imperfect Workloads

arXiv 2506.16007 ↗First posted 19 Jun 2025cs.DB cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Cardinality estimation (CardEst) is a critical aspect of query optimization. Traditionally, it leverages statistics built directly over the data. However, organizational policies (e.g., regulatory compliance) may restrict global data access. Fortunately, query-driven cardinality estimation can learn CardEst models using query workloads. However, existing query-driven models often require access to data or summaries for best performance, and they assume perfect training workloads with complete and balanced join templates (or join graphs). Such assumptions rarely hold in real-world scenarios, in which join templates are incomplete and imbalanced. We present GRASP, a data-agnostic cardinality learning system designed to work under these real-world constraints. GRASP's compositional design generalizes to unseen join templates and is robust to join template imbalance. It also introduces a new per-table CardEst model that handles value distribution shifts for range predicates, and a novel learned count sketch model that captures join correlations across base relations. Across three database instances, we demonstrate that GRASP consistently outperforms existing query-driven models on imperfect workloads, both in terms of estimation accuracy and query latency. Remarkably, GRASP achieves performance comparable to, or even surpassing, traditional approaches built over the underlying data on the complex CEB-IMDb-full benchmark -- despite operating without any data access and using only 10% of all possible join templates.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 17 of its 63 references that are in the map. First posted on arXiv 19 Jun 2025.

Builds on

17 of 63 references.

References · 17

  1. 2019Neural Spline Flowscited by 596
  2. 2015MADE: Masked Autoencoder for Distribution Estimationcited by 307
  3. 2018Learned Cardinalities: Estimating Correlated Joins with Deep Learningcited by 64
  4. 2018Learning Compositional Representations for Few-Shot Recognitioncited by 50
  5. 2021Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluationcited by 30
  6. 2021Flow-Loss: Learning Cardinality Estimates That Mattercited by 22
  7. 2020NeuroCard: One Cardinality Estimator for All Tablescited by 21
  8. 2021A Unified Deep Model of Learning from both Data and Queries for Cardinality Estimationcited by 21
  9. 2019DeepDB: Learn from Data, not from Queries!cited by 20
  10. 2022FactorJoin: A New Cardinality Estimation Framework for Join Queriescited by 13
  11. 2023ALECE: An Attention-based Learned Cardinality Estimator for SPJ Queries on Dynamic Workloads (Extended)cited by 13
  12. 2018QuickSel: Quick Selectivity Learning with Mixture Modelscited by 12
5 more
  1. 2023Duet: efficient and scalable hybriD neUral rElation undersTandingcited by 3
  2. 2024Convolution and Cross-Correlation of Count Sketches Enables Fast Cardinality Estimation of Multi-Join Queriescited by 3
  3. 2024A Practical Theory of Generalization in Selectivity Learningcited by 3
  4. 2016The BigDAWG Polystore System and Architecturecited by 2
  5. 2022SafeBound: A Practical System for Generating Cardinality Boundscited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.