Yannakakis algorithm
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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.
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.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1370020272 under CC BY-SA 4.0; modifications have been made.