Pith. sign in

REVIEW 2 cited by

An Empirical Analysis of Deep Learning for Cardinality Estimation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1905.06425 v2 pith:2NHKG5QM submitted 2019-05-15 cs.DB

classification cs.DB
keywords cardinalitydeeplearningmodelsacrossdatasetsestimatesestimation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We implement and evaluate deep learning for cardinality estimation by studying the accuracy, space and time trade-offs across several architectures. We find that simple deep learning models can learn cardinality estimations across a variety of datasets (reducing the error by 72% - 98% on average compared to PostgreSQL). In addition, we empirically evaluate the impact of injecting cardinality estimates produced by deep learning models into the PostgreSQL optimizer. In many cases, the estimates from these models lead to better query plans across all datasets, reducing the runtimes by up to 49% on select-project-join workloads. As promising as these models are, we also discuss and address some of the challenges of using them in practice.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. PLANSIEVE: Real-time Suboptimal Query Plan Detection Through Incremental Refinements

    cs.DB 2025-01 conditional novelty 5.0 of 10

    PLANSIEVE uses a transformer and L1-error to classify query plans as suboptimal during optimization, using surrogate cardinalities refined with observed execution results.

  2. HERO: Hint-Based Efficient and Reliable Query Optimizer

    cs.DB 2024-12 conditional novelty 5.0 of 10

    HERO combines an ensemble of context-aware models stored as a graph with a parameterized local search to recommend query hints and parallelism settings, reporting up to 3x speedup on JOB at lower inference cost than N...

Pith tools