Degree sequence bound for join cardinality estimation

DOI10.4230/LIPICS.ICDT.2023.8MaRDI QIDQ6615179zbMATH OpenFDO

Authors Kyle Deeds, Dan Suciu, Magda Balazinska, Walter Cai

Publication date 8 October 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2023.8

zbMATH Keywords

berge-acyclic queriescardinality boundingcardinality estimationdegree boundsfunctional approximationquery planning

Mathematics Subject Classification ID

Database theory (68P15)

Cited in

(6)

• Join sampling under acyclic degree constraints and (cyclic) subgraph sampling
• Join and subgraph sampling under degree constraints
• Degree sequence bounds
• The quest for faster join algorithms (invited talk)
• Partition constraints for conjunctive queries: bounds and worst-case optimal joins
• Irreducible Markov chains on spaces of graphs with fixed degree-color sequences

This page was built for publication: Degree sequence bound for join cardinality estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615179)