A cost model that splits join selectivity into match probability and fanout, and counts redundant probes, makes join-order optimization for many-to-many joins more accurate and more robust.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DB 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Optimizing Queries with Many-to-Many Joins
A cost model that splits join selectivity into match probability and fanout, and counts redundant probes, makes join-order optimization for many-to-many joins more accurate and more robust.