DBScholar

Back to papers

Parallel Evaluation of Conjunctive Queries

Summary: Propose a simple synchronous parallel model measuring global synchronization rounds to analyze conjunctive-query evaluation on massive clusters. Characterize one-round computable queries as "tall-flat" (strict subset of hierarchical), give a one-round algorithm and matching impossibility for others, with extensions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1550
Venue
PODS
Year
2011
Pagerank
0.00012997301
Overall Rank
954 | 93.46%
DOI
10.1145/1989284.1989310

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{koutris_pods11,
        address = {New York, NY, USA},
        series = {{PODS} '11},
        title = {{Parallel Evaluation of Conjunctive Queries}},
        url = {https://dl.acm.org/doi/10.1145/1989284.1989310},
        doi = {10.1145/1989284.1989310},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Koutris, Paraschos and Suciu, Dan},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 27 of 27 citing papers.

Rank Citing Paper Year Venue Pagerank
636 Answering Conjunctive Queries under Updates 2017 PODS 0.0001551856
816 The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017 SIGMOD 0.00013827772
1,207 Communication Steps for Parallel Query Processing 2013 PODS 0.00011663155
1,319 SkewTune: Mitigating Skew in MapReduce Applications 2012 SIGMOD 0.00011175005
1,320 From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System 2015 SIGMOD 0.00011166426
1,514 Upper and Lower Bounds on the Cost of a Map-Reduce Computation 2013 VLDB 0.00010527649
1,998 A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries 2017 PODS 9.3363505e-05
2,295 Optimizing Graph Algorithms on Pregel-like Systems 2014 VLDB 8.7932254e-05
2,462 Output-optimal Parallel Algorithms for Similarity Joins 2017 PODS 8.5487602e-05
2,539 Minimal MapReduce Algorithms 2013 SIGMOD 8.4526595e-05
3,136 Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries 2020 PODS 7.7210541e-05
4,371 Instance and Output Optimal Parallel Algorithms for Acyclic Joins 2019 PODS 6.738679e-05
4,832 Association Rules with Graph Patterns 2015 VLDB 6.4877e-05
5,463 Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins 2021 PODS 6.2086169e-05
6,398 Query Evaluation by Circuits 2022 PODS 5.8867918e-05
7,143 Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries 2020 PODS 5.6915726e-05
7,484 On Scale Independence for Querying Big Data 2014 PODS 5.6074278e-05
7,884 Weaker Forms of Monotonicity for Declarative Networking: a More Fine-grained Answer to the CALM-conjecture 2014 PODS 5.5229059e-05
8,446 Parallel-Correctness and Transferability for Conjunctive Queries 2015 PODS 5.4240058e-05
9,716 Querying Shared Data with Security Heterogeneity 2020 SIGMOD 5.2336921e-05
11,132 Topology-aware Parallel Joins 2024 PODS 5.093636e-05
11,634 Algorithms for a Topology-aware Massively Parallel Computation Model 2021 PODS 5.093636e-05
11,635 Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins 2021 PODS 5.093636e-05
11,894 Distributed Statistical Estimation of Matrix Products with Applications 2018 PODS 5.093636e-05
12,032 Logical Aspects of Massively Parallel and Distributed Systems 2016 PODS 5.093636e-05
12,082 Parallel Evaluation of Multi-Semi-Joins 2016 VLDB 5.093636e-05
12,294 Making Queries Tractable on Big Data with Preprocessing (through the eyes of complexity theory) 2013 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers