GYM: a multiround distributed join algorithm

DOI10.4230/LIPICS.ICDT.2017.4zbMATH Open1402.68036OpenAlexW2604241689MaRDI QIDQ3174892FDOQ3174892

Authors: Foto N. Afrati, Manas Joglekar, Christopher Re, Semih Salihoglu, Jeffrey D. Ullman 

Publication date: 18 July 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.ICDT.2017.4

Recommendations

• Communication steps for parallel query processing
• Parallel-correctness and transferability for conjunctive queries
• It's all a matter of degree. Using degree information to optimize multiway joins
• It's all a matter of degree: using degree information to optimize multiway joins
• Worst-case optimal algorithms for parallel query processing

zbMATH Keywords

joinsbulk synchronous processingGHDsYannakakis algorithm

Mathematics Subject Classification ID

Database theory (68P15) Distributed algorithms (68W15)

Cited In (8)

• Massively parallel entity matching with linear classification in low dimensional space
• The hardness of optimization problems on the weighted massively parallel computation model
• Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
• It's all a matter of degree. Using degree information to optimize multiway joins
• Title not available (Why is that?)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
• Scheduling MapReduce jobs on identical and unrelated processors
• Fast parallel hypertree decompositions in logarithmic recursion depth

This page was built for publication: GYM: a multiround distributed join algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174892)