Lesson plan
Yannakakis algorithm
The Yannakakis algorithm is an algorithm in database theory for evaluating acyclic join queries (more generally, (alpha-)acyclic conjunctive queries, see GYO algorithm). It first uses semijoins to prune tuples that cannot participate in any answer and then joins the reduced relations to produce the result. The algorithm is named after Mihalis Yannakakis.
Article summary
The Yannakakis algorithm is an algorithm in database theory for evaluating acyclic join queries (more generally, (alpha-)acyclic conjunctive queries, see GYO algorithm). It first uses semijoins to prune tuples that cannot participate in any answer and then joins the reduced relations to produce the result. The algorithm is named after Mihalis Yannakakis.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.