Worst-case optimal algorithms for parallel query processing

DOI10.4230/LIPICS.ICDT.2016.8MaRDI QIDQ5276187zbMATH OpenFDO

Authors Paraschos Koutris, Dan Suciu, Paul Beame

Publication date 14 July 2017

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

zbMATH Keywords

conjunctive queryparallel computationworst-case bounds

Mathematics Subject Classification ID

Database theory (68P15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Communication steps for parallel query processing
• Worst-case optimal join algorithms
• Output-optimal massively parallel algorithms for similarity joins
• Parallel-correctness and transferability for conjunctive queries
• scientific article; zbMATH DE number 5033869

Cited in

(15)

• It's all a matter of degree. Using degree information to optimize multiway joins
• GYM: a multiround distributed join algorithm
• Distribution policies for Datalog
• Massively parallel entity matching with linear classification in low dimensional space
• Communication steps for parallel query processing
• Output-optimal massively parallel algorithms for similarity joins
• scientific article; zbMATH DE number 7561474 (Why is no real title available?)
• scientific article; zbMATH DE number 7566062 (Why is no real title available?)
• The notion of abstraction in ontology-based data management
• Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model
• Parallel acyclic joins: optimal algorithms and cyclicity separation
• PAC: computing join queries with semi-covers
• Parallel query processing with heterogeneous machines
• Work-efficient query evaluation in constant time with PRAMs
• Distribution policies for Datalog

This page was built for publication: Worst-case optimal algorithms for parallel query processing

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