Database Theory in Action: Yannakakis' Algorithm
Paraschos Koutris, Stijn Vansummeren, Qichen Wang, Yisu Remy Wang, Xiangyao Yu

TL;DR
This paper reviews recent improvements to Yannakakis' algorithm, making it more practical for real-world database join operations by enhancing efficiency and implementation simplicity.
Contribution
It surveys recent advancements that adapt Yannakakis' algorithm for practical use, highlighting new techniques and future research directions.
Findings
Enhanced efficiency of Yannakakis' algorithm in practice
Simplified implementation methods for the algorithm
Identification of promising future research avenues
Abstract
Yannakakis' seminal algorithm is optimal for acyclic joins, yet it has not been widely adopted due to its poor performance in practice. This paper briefly surveys recent advancements in making Yannakakis' algorithm more practical, in terms of both efficiency and ease of implementation, and points out several avenues for future research.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Advanced Database Systems and Queries · semigroups and automata theory
