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.00011340141
Overall Rank
1,249 | 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
315 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021246
712 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014578373
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011627669
1,596 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 0.00010127607
2,014 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1832045e-05
2,468 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.4178183e-05
2,774 GraphScope: A Unified Engine For Big Graph Processing 2021 VLDB 8.0327008e-05
3,011 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7549462e-05
3,160 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.5807496e-05
3,847 Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs 2021 SIGMOD 6.9831533e-05
3,880 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.9510799e-05
4,075 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8188389e-05
4,123 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7927568e-05
4,511 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.5681258e-05
4,950 Debunking the Myth of Join Ordering: Toward Robust SQL Analytics 2025 SIGMOD 6.3421691e-05
5,396 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.1494643e-05
5,558 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 6.0850942e-05
5,672 Subgraph Matching over Graph Federation 2022 VLDB 6.0433033e-05
5,684 iTurboGraph: Scaling and Automating Incremental Graph Analytics 2021 SIGMOD 6.0391416e-05
5,984 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.926237e-05
6,232 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.84313e-05
6,893 PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware 2024 SIGMOD 5.6540469e-05
7,248 Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale 2022 VLDB 5.5746656e-05
7,529 Fast Local Subgraph Counting 2024 VLDB 5.5009945e-05
8,980 Graphsurge: Graph Analytics on View Collections Using Differential Computation 2021 SIGMOD 5.2437006e-05
9,030 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.2340466e-05
9,148 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.2189946e-05
9,659 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 5.1453267e-05
9,715 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.1359137e-05
10,127 A Modular Graph-Native Query Optimization Framework 2025 SIGMOD 5.0751052e-05
10,254 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.050482e-05
10,301 Worst-Case-Optimal Similarity Joins on Graph Databases 2024 SIGMOD 5.040157e-05
10,675 R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization 2026 SIGMOD 4.9793485e-05
10,708 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 4.9793485e-05
10,734 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9793485e-05
10,740 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9793485e-05
10,989 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.9793485e-05
11,203 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 4.9793485e-05
11,546 Towards a Converged Relational-Graph Optimization Framework 2024 SIGMOD 4.9793485e-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.0012092602
39 Efficiently Updating Materialized Views 1986 SIGMOD 0.00046602544
62 Maintaining Views Incrementally 1993 SIGMOD 0.00039045511
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024884544
231 Storm @Twitter 2014 SIGMOD 0.00023841089
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
357 FAQ: Questions Asked Frequently 2016 PODS 0.00020020639
402 Worst-case Optimal Join Algorithms 2012 PODS 0.00019104625
408 DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views 2012 VLDB 0.00018900199
443 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018197688
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
783 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00014021799
1,045 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012322402
1,046 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012319866
1,231 Communication Steps for Parallel Query Processing 2013 PODS 0.00011410373
1,410 A Distributed Graph Engine for Web Scale RDF Data 2013 VLDB 0.00010742208
1,481 Skew in Parallel Query Processing 2014 PODS 0.00010539119
1,545 Upper and Lower Bounds on the Cost of a Map-Reduce Computation 2013 VLDB 0.00010302384
1,725 Beyond Worst-case Analysis for Joins with Minesweeper 2014 PODS 9.7902443e-05
1,804 gStore: Answering SPARQL Queries via Subgraph Matching 2011 VLDB 9.6025094e-05
1,873 Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs 2014 VLDB 9.4579851e-05
2,020 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1729558e-05
2,464 Output-optimal Parallel Algorithms for Similarity Joins 2017 PODS 8.4260608e-05
7,159 SPARTex: A Vertex-Centric Framework for RDF Data Analytics 2015 VLDB 5.5964781e-05
Previous Page 1 / 1 Next

Semantically Similar Papers