Communication Steps for Parallel Query Processing

DOI10.1145/3125644zbMath1426.68074arXiv1306.5972OpenAlexW2765269579MaRDI QIDQ4640349

Dan Suciu, Paraschos Koutris, P. W. Beame

Publication date: 17 May 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.5972

zbMATH Keywords

parallel computationlower bounds

Mathematics Subject Classification ID

Database theory (68P15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (21)

Equivalence classes and conditional hardness in massively parallel computations ⋮ The Range of Topological Effects on Communication ⋮ Optimal broadcasting strategies for conjunctive queries over distributed data ⋮ Graph Connectivity in Log Steps Using Label Propagation ⋮ Graph reconstruction in the congested clique ⋮ Modern Datalog Engines ⋮ Deterministic Massively Parallel Connectivity ⋮ When distributed computation is communication expensive ⋮ Component stability in low-space massively parallel computation ⋮ Massively parallel and streaming algorithms for balanced clustering ⋮ Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory ⋮ Round Compression for Parallel Matching Algorithms ⋮ Adaptive Online First-Order Monitoring ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Distribution policies for Datalog ⋮ A formally verified, optimized monitor for metric first-order dynamic logic ⋮ Distributed algorithms for matching in hypergraphs

This page was built for publication: Communication Steps for Parallel Query Processing