Fast and Robust Distributed Subgraph Enumeration
Summary: RADS: a robust asynchronous distributed system for subgraph enumeration that reduces memory pressure and indexing cost. It pre-identifies single-machine results, uses region-grouped multi-round expand-verify-filter with no inter-node shuffles or data replication, and delivers strong empirical gains. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xuguang Ren
- 2. Junhu Wang
- 3. Wook-Shin Han
- 4. Jeffrey Xu Yu
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,488 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD | 7.0460627e-05 |
| 5,002 | HUGE: An Efficient and Scalable Subgraph Enumeration System | 2021 | SIGMOD | 5.7610359e-05 |
| 5,921 | RapidFlow: An Efficient Approach to Continuous Subgraph Matching | 2022 | VLDB | 5.2681722e-05 |
| 7,674 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB | 4.677258e-05 |
| 7,936 | Fast Local Subgraph Counting | 2024 | VLDB | 4.6089395e-05 |
| 8,145 | Capturing Associations in Graphs | 2020 | VLDB | 4.5724134e-05 |
| 9,519 | Banyan: A Scoped Dataflow Engine for Graph Query Service | 2022 | VLDB | 4.3287375e-05 |
| 10,131 | A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] | 2026 | SIGMOD | 4.1905499e-05 |
| 10,270 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB | 4.1905499e-05 |
| 10,740 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB | 4.1905499e-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 | Pagerank |
|---|---|---|---|---|
| 2,787 | Scalable Distributed Subgraph Enumeration | 2017 | VLDB | 8.1219297e-05 |
| 6,086 | Subgraph Matching over Graph Federation | 2022 | VLDB | 5.2157921e-05 |
| 7,674 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB | 4.677258e-05 |
| 7,003 | RAGraph: A Region-Aware Framework for Geo-Distributed Graph Processing | 2024 | VLDB | 4.8609956e-05 |
| 648 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018688754 |
| 3,488 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD | 7.0460627e-05 |
| 1,948 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB | 9.9938634e-05 |
| 2,799 | DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine | 2016 | SIGMOD | 8.109137e-05 |
| 9,086 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD | 4.3947639e-05 |
| 5,002 | HUGE: An Efficient and Scalable Subgraph Enumeration System | 2021 | SIGMOD | 5.7610359e-05 |