Chow-Liu trees approximate attribute distributions per relation to relax independence assumptions, yielding an order of magnitude better selectivity estimates on TPC-DS than prior methods while staying efficient.
Query optimization through the looking glass, and what we found running the join order benchmark
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Approach Based on Bayesian Networks for Query Selectivity Estimation
Chow-Liu trees approximate attribute distributions per relation to relax independence assumptions, yielding an order of magnitude better selectivity estimates on TPC-DS than prior methods while staying efficient.