Fast and Robust Distributed Subgraph Enumeration
Summary: RADS is an asynchronous, robust framework for distributed subgraph enumeration that exploits single-machine results. Its region-grouped expand–verify–filter avoids intermediate-result shuffling and graph replication, reducing memory/network costs while improving load balance. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xuguang Ren (Griffith University)
- 2. Junhu Wang (Griffith University)
- 3. Wook-Shin Han (Pohang University of Science and Technology)
- 4. Jeffrey Xu Yu (Chinese University of Hong Kong)
BibTeX Citation
@article{ren_vldb19,
title = {{Fast and Robust Distributed Subgraph Enumeration}},
author = {Ren, Xuguang and Wang, Junhu and Han, Wook-Shin and Yu, Jeffrey Xu},
journal = {PVLDB},
series = {{VLDB} '19},
volume = {12},
number = {11},
pages = {1344--1356},
doi = {10.14778/3342263.3342272},
url = {https://doi.org/10.14778/3342263.3342272},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,607 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD | 8.3489531e-05 |
| 4,158 | HUGE: An Efficient and Scalable Subgraph Enumeration System | 2021 | SIGMOD | 6.8628196e-05 |
| 5,275 | RapidFlow: An Efficient Approach to Continuous Subgraph Matching | 2022 | VLDB | 6.2873652e-05 |
| 7,418 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB | 5.6236086e-05 |
| 8,113 | Capturing Associations in Graphs | 2020 | VLDB | 5.484341e-05 |
| 8,251 | Fast Local Subgraph Counting | 2024 | VLDB | 5.4574671e-05 |
| 9,532 | Banyan: A Scoped Dataflow Engine for Graph Query Service | 2022 | VLDB | 5.2537948e-05 |
| 9,693 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB | 5.2351259e-05 |
| 10,419 | A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] | 2026 | SIGMOD | 5.093636e-05 |
| 10,558 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,581 | Subgraph Matching over Graph Federation | 2022 | VLDB |
| 2 | 2,065 | Scalable Distributed Subgraph Enumeration | 2017 | VLDB |
| 3 | 7,418 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB |
| 4 | 6,857 | RAGraph: A Region-Aware Framework for Geo-Distributed Graph Processing | 2024 | VLDB |
| 5 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 6 | 2,607 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD |
| 7 | 1,246 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 8 | 2,119 | DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine | 2016 | SIGMOD |
| 9 | 9,118 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD |
| 10 | 4,158 | HUGE: An Efficient and Scalable Subgraph Enumeration System | 2021 | SIGMOD |