The quest for faster join algorithms (invited talk)

DOI10.4230/LIPICS.ICDT.2025.1MaRDI QIDQ7292762zbMATH OpenFDO

Authors Paraschos Koutris, Shaleen Deep, Austen Z. Fan, Hangdong Zhao

Publication date 8 July 2026

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• Degree sequence bound for join cardinality estimation
• Finding and counting given length cycles
• General space-time tradeoffs via relational queries
• Graph minors. III. Planar tree-width
• Improved roundtrip spanners, emulators, and directed girth approximation
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Ranked enumeration of conjunctive query results
• Size bounds for factorised representations of query results
• The fine-grained complexity of Boolean conjunctive queries and sum-product problems
• The monotone circuit complexity of Boolean functions
• Tractable hypergraph properties for constraint satisfaction and conjunctive queries
• Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
• Worst-case optimal join algorithms

This page was built for publication: The quest for faster join algorithms (invited talk)

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