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
11964
Venue
VLDB
Year
2018
Pagerank
0.00011504088
Overall Rank
1,246 | 91.46%
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
321 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021283186
809 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00013874588
1,006 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012699518
1,237 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011545768
1,740 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.875587e-05
2,035 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2787188e-05
2,607 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.3489531e-05
2,915 GraphScope: A Unified Engine For Big Graph Processing 2021 VLDB 7.9666977e-05
3,102 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7568687e-05
3,283 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.56675e-05
3,778 Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs 2021 SIGMOD 7.1334329e-05
3,821 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 7.0933895e-05
4,158 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.8628196e-05
4,563 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6291459e-05
4,983 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.4127092e-05
5,296 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.2782852e-05
5,427 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 6.2230767e-05
5,529 Debunking the Myth of Join Ordering: Toward Robust SQL Analytics 2025 SIGMOD 6.18591e-05
5,567 iTurboGraph: Scaling and Automating Incremental Graph Analytics 2021 SIGMOD 6.1709411e-05
5,581 Subgraph Matching over Graph Federation 2022 VLDB 6.1624715e-05
5,870 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 6.061038e-05
6,149 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.9581422e-05
7,067 PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware 2024 SIGMOD 5.7120928e-05
7,418 Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale 2022 VLDB 5.6236086e-05
8,251 Fast Local Subgraph Counting 2024 VLDB 5.4574671e-05
8,830 Graphsurge: Graph Analytics on View Collections Using Differential Computation 2021 SIGMOD 5.3611079e-05
8,871 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.35418e-05
9,440 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.2680376e-05
9,478 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 5.2634238e-05
9,532 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.2537948e-05
9,942 A Modular Graph-Native Query Optimization Framework 2025 SIGMOD 5.1915905e-05
10,087 Worst-Case-Optimal Similarity Joins on Graph Databases 2024 SIGMOD 5.1558402e-05
10,419 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,488 R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization 2026 SIGMOD 5.093636e-05
10,524 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 5.093636e-05
10,552 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 5.093636e-05
10,558 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 5.093636e-05
10,590 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 5.093636e-05
10,787 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 5.093636e-05
11,205 Towards a Converged Relational-Graph Optimization Framework 2024 SIGMOD 5.093636e-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.0012250108
39 Efficiently Updating Materialized Views 1986 SIGMOD 0.00047309646
61 Maintaining Views Incrementally 1993 SIGMOD 0.00039026867
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
220 Storm @Twitter 2014 SIGMOD 0.00024244587
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
358 FAQ: Questions Asked Frequently 2016 PODS 0.00020243592
411 Worst-case Optimal Join Algorithms 2012 PODS 0.00018902089
438 DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views 2012 VLDB 0.00018471721
442 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018398144
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017717377
776 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00014110016
1,036 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012499878
1,058 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012378784
1,207 Communication Steps for Parallel Query Processing 2013 PODS 0.00011663155
1,387 A Distributed Graph Engine for Web Scale RDF Data 2013 VLDB 0.00010949523
1,448 Skew in Parallel Query Processing 2014 PODS 0.00010758872
1,514 Upper and Lower Bounds on the Cost of a Map-Reduce Computation 2013 VLDB 0.00010527649
1,699 Beyond Worst-case Analysis for Joins with Minesweeper 2014 PODS 9.975915e-05
1,774 gStore: Answering SPARQL Queries via Subgraph Matching 2011 VLDB 9.7870727e-05
1,944 Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs 2014 VLDB 9.4354517e-05
2,065 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.2352771e-05
2,462 Output-optimal Parallel Algorithms for Similarity Joins 2017 PODS 8.5487602e-05
7,022 SPARTex: A Vertex-Centric Framework for RDF Data Analytics 2015 VLDB 5.7242241e-05
Previous Page 1 / 1 Next

Semantically Similar Papers