Learned Cardinalities: Estimating Correlated Joins with Deep Learning

Andreas Kipf, Thomas Kipf, Bernhard Radke, Viktor Leis, Peter Boncz +1 more
9/3/2018
cs.DB

Official code: andreaskipf/learnedcardinalities (134 stars, MIT, last commit 2019-05-06).

Abstract

We describe a new deep learning approach to cardinality estimation. MSCN is a multi-set convolutional network, tailored to representing relational query plans, that employs set semantics to capture query features and true cardinalities. MSCN builds on sampling-based estimation, addressing its weaknesses when no sampled tuples qualify a predicate, and in capturing join-crossing correlations. Our evaluation of MSCN using a real-world dataset shows that deep learning significantly enhances the quality of cardinality estimation, which is the core problem in query optimization.

View on arXivView PDF

Code Implementations(1)

MIT

Code and workloads from the Learned Cardinalities paper (https://arxiv.org/abs/1809.00677)

13460PythonDec 14, 20187 years agoMIT

Cite this paper

@article{kipf2018learned,
  title  = {Learned Cardinalities: Estimating Correlated Joins with Deep Learning},
  author = {Andreas Kipf and Thomas Kipf and Bernhard Radke and Viktor Leis and Peter Boncz and Alfons Kemper},
  year   = {2018},
  eprint = {1809.00677},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1809.00677}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1809.00677.svg)](https://codeofpaper.com/paper/1809.00677)

Discussion