mlsanityData to 14 Oct 2026

PRICE: A Pretrained Model for Cross-Database Cardinality Estimation

arXiv 2406.01027 ↗First posted 3 Jun 2024cs.DB cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

Cardinality estimation (CardEst) is essential for optimizing query execution plans. Recent ML-based CardEst methods achieve high accuracy but face deployment challenges due to high preparation costs and lack of transferability across databases. In this paper, we propose PRICE, a PRetrained multI-table CardEst model, which addresses these limitations. PRICE takes low-level but transferable features w.r.t. data distributions and query information and elegantly applies self-attention models to learn meta-knowledge to compute cardinality in any database. It is generally applicable to any unseen new database to attain high estimation accuracy, while its preparation cost is as little as the basic one-dimensional histogram-based CardEst methods. Moreover, PRICE can be finetuned to further enhance its performance on any specific database. We pretrained PRICE using 30 diverse datasets, completing the process in about 5 hours with a resulting model size of only about 40MB. Evaluations show that PRICE consistently outperforms existing methods, achieving the highest estimation accuracy on several unseen databases and generating faster execution plans with lower overhead. After finetuning with a small volume of databasespecific queries, PRICE could even find plans very close to the optimal ones. Meanwhile, PRICE is generally applicable to different settings such as data updates, data scaling, and query workload shifts. We have made all of our data and codes publicly available at https://github.com/StCarmen/PRICE.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 24 of its 76 references that are in the map. First posted on arXiv 3 Jun 2024.

Builds on

24 of 76 references.

References · 24

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  5. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
  6. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  7. 2017Deep Neural Networks as Gaussian Processescited by 622
  8. 2018Learned Cardinalities: Estimating Correlated Joins with Deep Learningcited by 64
  9. 2019Deep Unsupervised Cardinality Estimationcited by 36
  10. 2021Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluationcited by 30
  11. 2013The Randomized Dependence Coefficientcited by 26
  12. 2020FLAT: Fast, Lightweight and Accurate Method for Cardinality Estimationcited by 22
12 more
  1. 2020NeuroCard: One Cardinality Estimator for All Tablescited by 21
  2. 2021A Unified Deep Model of Learning from both Data and Queries for Cardinality Estimationcited by 21
  3. 2019DeepDB: Learn from Data, not from Queries!cited by 20
  4. 2020Are We Ready For Learned Cardinality Estimation?cited by 19
  5. 2022Zero-Shot Cost Models for Out-of-the-box Learned Cost Predictioncited by 16
  6. 2022FactorJoin: A New Cardinality Estimation Framework for Join Queriescited by 13
  7. 2023ALECE: An Attention-based Learned Cardinality Estimator for SPJ Queries on Dynamic Workloads (Extended)cited by 13
  8. 2020BayesCard: Revitilizing Bayesian Frameworks for Cardinality Estimationcited by 10
  9. 2021A Unified Transferable Model for ML-Enhanced DBMScited by 10
  10. 2021One Model to Rule them All: Towards Zero-Shot Learning for Databasescited by 9
  11. 2020FSPN: A New Class of Probabilistic Graphical Modelcited by 6
  12. 2022Zero-Shot Cost Models for Distributed Stream Processingcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 6; 2026: 2.

8 papers.