DBScholar

Back to papers

Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows

Summary: Distributed worst-case-optimal dataflows for dynamic subgraph queries and equi-joins, with linear total memory and provably linear per-worker scaling despite adversarial skew. Implemented in Timely Dataflow and evaluated on graphs up to 64B edges. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
h51f7fbf959dadb20
Venue
VLDB
Year
2018
Pagerank
0.00011316982
Overall Rank
1,253 | 91.61%
DOI
10.14778/3184470.3184473

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{ammar_vldb18,
        title = {{Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows}},
        author = {Ammar, Khaled and McSherry, Frank and Salihoglu, Semih and Joglekar, Manas},
        journal = {PVLDB},
        series = {{VLDB} '18},
        volume = {11},
        number = {6},
        pages = {691--704},
        doi = {10.14778/3184470.3184473},
        url = {https://doi.org/10.14778/3184470.3184473},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 40 of 40 citing papers.

Rank Citing Paper Year Venue Pagerank
318 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021178303
706 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014622696
952 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012878316
1,171 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011677799
1,603 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 0.00010090639
1,988 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2301018e-05
2,478 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.3890338e-05
2,594 GraphScope: A Unified Engine For Big Graph Processing 2021 VLDB 8.2278437e-05
3,020 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7267183e-05
3,105 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.6278115e-05
3,855 Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs 2021 SIGMOD 6.9567679e-05
3,885 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.9282318e-05
4,099 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.7940875e-05
4,133 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7738028e-05
4,370 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6213567e-05
4,971 Debunking the Myth of Join Ordering: Toward Robust SQL Analytics 2025 SIGMOD 6.3209003e-05
5,418 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.1264302e-05
5,576 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 6.062102e-05
5,676 Subgraph Matching over Graph Federation 2022 VLDB 6.0246247e-05
5,690 iTurboGraph: Scaling and Automating Incremental Graph Analytics 2021 SIGMOD 6.0182427e-05
5,995 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.903845e-05
6,245 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.8210521e-05
6,909 PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware 2024 SIGMOD 5.6336966e-05
7,268 Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale 2022 VLDB 5.553602e-05
7,552 Fast Local Subgraph Counting 2024 VLDB 5.4802093e-05
9,010 Graphsurge: Graph Analytics on View Collections Using Differential Computation 2021 SIGMOD 5.2238876e-05
9,059 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.21427e-05
9,179 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.1992749e-05
9,695 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 5.1258854e-05
9,750 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.1165079e-05
10,168 A Modular Graph-Native Query Optimization Framework 2025 SIGMOD 5.0559291e-05
10,289 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.031399e-05
10,336 Worst-Case-Optimal Similarity Joins on Graph Databases 2024 SIGMOD 5.0211131e-05
10,747 R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization 2026 SIGMOD 4.9605343e-05
10,779 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 4.9605343e-05
10,805 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9605343e-05
10,811 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9605343e-05
11,059 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.9605343e-05
11,270 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 4.9605343e-05
11,601 Towards a Converged Relational-Graph Optimization Framework 2024 SIGMOD 4.9605343e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 24 of 24 cited papers.

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

Rank Cited Paper Year Venue Pagerank
3 Pregel: A System for Large-Scale Graph Processing 2010 SIGMOD 0.0012089097
39 Efficiently Updating Materialized Views 1986 SIGMOD 0.00046445099
62 Maintaining Views Incrementally 1993 SIGMOD 0.00038944207
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024929198
233 Storm @Twitter 2014 SIGMOD 0.00023754096
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022009138
357 FAQ: Questions Asked Frequently 2016 PODS 0.00020048899
397 Worst-case Optimal Join Algorithms 2012 PODS 0.0001911958
408 DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views 2012 VLDB 0.00018836656
440 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018235529
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017479773
786 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00013979657
1,046 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012315969
1,049 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012293903
1,242 Communication Steps for Parallel Query Processing 2013 PODS 0.00011372366
1,417 A Distributed Graph Engine for Web Scale RDF Data 2013 VLDB 0.00010706533
1,483 Skew in Parallel Query Processing 2014 PODS 0.00010500209
1,547 Upper and Lower Bounds on the Cost of a Map-Reduce Computation 2013 VLDB 0.00010268377
1,734 Beyond Worst-case Analysis for Joins with Minesweeper 2014 PODS 9.7545941e-05
1,813 gStore: Answering SPARQL Queries via Subgraph Matching 2011 VLDB 9.5705978e-05
1,879 Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs 2014 VLDB 9.4293777e-05
2,023 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1568397e-05
2,475 Output-optimal Parallel Algorithms for Similarity Joins 2017 PODS 8.3947133e-05
7,184 SPARTex: A Vertex-Centric Framework for RDF Data Analytics 2015 VLDB 5.5753492e-05
Previous Page 1 / 1 Next

Semantically Similar Papers