HackerPapers

arXiv:2601.00098cs.DB

Database Theory in Action: Yannakakis' Algorithm

Paraschos Koutris, Stijn Vansummeren, Qichen Wang, Yisu Remy Wang, Xiangyao Yu

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
Journal reference
DOI
Subjects
cs.DBDatabases

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Aug 2026 to Aug 2026.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Ask HN: Who needs funding for DB research? 1 comment

    • Remy Wang, Assistant Professor @ UCLA https://remy.wang Working on: - Query languages (Prela [1] and Datalog) - Join algorithms (WCOJ, instance-optimal joins [2], join ordering) [1]: https://prela-lang.org [2]: https://arxiv.org/abs/2601.00098

      remywangView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.