GYM: A Multiround Join Algorithm In MapReduce

  title={GYM: A Multiround Join Algorithm In MapReduce},
  author={Foto N. Afrati and Manas Joglekar and Christopher R{\'e} and Semih Salihoglu and Jeffrey D. Ullman},
We study the problem of computing the join of n relations in multiple rounds of MapReduce. We introduce a distributed and generalized version of Yannakakis’s algorithm, called GYM. GYM takes as input any generalized hypertree decomposition (GHD) of a query of width w and depth d, and computes the query in O(d) rounds and O(n(IN + OUT)) communication and computation cost. Using GYM we achieve two main results: (1) Every widthw query can be computed in O(n) rounds of MapReduce with O(n(IN + OUT… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 23 references

Advanced Parallel Algorithms for Acyclic Conjunctive Queries

G. Gottlob, N. Leone, F. Scarcello
Technical report, Vienna University of Technology, • 1998
View 19 Excerpts
Highly Influenced

Algorithms for Acyclic Database Schemes

VLDB • 1981
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…