Database Paper Browser

Back to papers

Parallel Query Processing: To Separate Communication from Computation

Summary: Separates communication from computation in parallel query processing via otimes, op^p, and merge to expose data movement and local execution. Proposes partitioning push-down and computation push-up; demonstrates Secco on SparkSQL with real-dataset gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6474
Venue
SIGMOD
Year
2022
Pagerank
4.3556432e-05
Overall Rank
9,330 | 35.10%
DOI
10.1145/3514221.3526164

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
11,132 A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition 2024 VLDB 4.1945683e-05
11,197 QaaD (Query-as-a-Data): Scalable Execution of Massive Number of Small Queries in Spark 2023 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 32 of 32 cited papers.

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

Rank Cited Paper Year Venue Pagerank
4 Pregel: A System for Large-Scale Graph Processing 2010 SIGMOD 0.0019005923
22 SCOPE: Easy and Efficient Parallel Processing of Massive Data Sets 2008 VLDB 0.0008456613
66 Spark SQL: Relational Data Processing in Spark 2015 SIGMOD 0.00061639801
113 Encapsulation of Parallelism in the Volcano Query Processing System 1990 SIGMOD 0.00046764513
248 Eager Aggregation and Lazy Aggregation 1995 VLDB 0.00030785339
444 Parallelizing Sequential Graph Computations 2017 SIGMOD 0.00022987918
454 An Overview of Query Optimization in Relational Systems 1998 PODS 0.00022734812
651 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018648572
1,015 Spanner: Becoming a SQL System 2017 SIGMOD 0.00014638696
1,328 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00012565612
1,924 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010077055
1,939 From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System 2015 SIGMOD 0.00010025655
1,953 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 9.9665955e-05
2,162 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 9.3964337e-05
2,212 Skew in Parallel Query Processing 2014 PODS 9.2771827e-05
2,529 Pregelix: Big(ger) Graph Analytics on A Dataflow Engine 2015 VLDB 8.5940768e-05
2,709 Vertexica: Your Relational Friend for Graph Analytics! 2014 VLDB 8.2530203e-05
2,801 Scalable Distributed Subgraph Enumeration 2017 VLDB 8.0992955e-05
2,849 A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries 2017 PODS 8.0195487e-05
2,997 Subgraph Matching: on Compression and Computation 2018 VLDB 7.7559339e-05
3,200 Big Data Analytics with Datalog Queries on Spark 2016 SIGMOD 7.3912411e-05
3,215 Fractal: A General-Purpose Graph Pattern Mining System 2019 SIGMOD 7.3645742e-05
3,443 Distributed Join Algorithms on Thousands of Cores 2017 VLDB 7.0887214e-05
3,988 All-in-One: Graph Processing in RDBMSs Revisited 2017 SIGMOD 6.5589605e-05
4,061 Advanced Partitioning Techniques for Massively Distributed Computation 2012 SIGMOD 6.483587e-05
4,556 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.0883757e-05
4,708 Instance and Output Optimal Parallel Algorithms for Acyclic Joins 2019 PODS 5.980172e-05
5,009 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 5.761237e-05
5,017 TurboGraph++: A Scalable and Fast Graph Analytics System 2018 SIGMOD 5.7574792e-05
6,673 Incorporating Super-Operators in Big-Data Query Optimizers 2020 VLDB 4.966799e-05
8,432 SPRINTER: A Fast n-ary Join Query Processing Method for Complex OLAP Queries 2020 SIGMOD 4.5153924e-05
9,282 Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing 2016 SIGMOD 4.3634964e-05
Previous Page 1 / 1 Next

Semantically Similar Papers