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)

Paper ID: 11829
Venue: VLDB
Year: 2019
Pagerank: 5.317401e-05
Overall Rank: 5,811 | 59.58%
DOI: 10.14778/3342263.3342272

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,641	GPU-Accelerated Subgraph Enumeration on Partitioned Graphs	2020	SIGMOD	6.8884895e-05
5,009	HUGE: An Efficient and Scalable Subgraph Enumeration System	2021	SIGMOD	5.761237e-05
5,926	RapidFlow: An Efficient Approach to Continuous Subgraph Matching	2022	VLDB	5.271318e-05
7,675	Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale	2022	VLDB	4.6817479e-05
7,934	Fast Local Subgraph Counting	2024	VLDB	4.613363e-05
8,211	Capturing Associations in Graphs	2020	VLDB	4.5581054e-05
9,518	Banyan: A Scoped Dataflow Engine for Graph Query Service	2022	VLDB	4.3328897e-05
10,131	A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis]	2026	SIGMOD	4.1945683e-05
10,270	Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration	2026	VLDB	4.1945683e-05
10,733	Subgraph Matching: A New Decomposition Based Approach	2025	VLDB	4.1945683e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
4	Pregel: A System for Large-Scale Graph Processing	2010	SIGMOD	0.0019005923
444	Parallelizing Sequential Graph Computations	2017	SIGMOD	0.00022987918
764	TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases	2013	SIGMOD	0.00017018712
1,500	Parallel Subgraph Listing in a Large-Scale Graph	2014	SIGMOD	0.00011674394
1,635	An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases	2013	VLDB	0.0001105793
1,953	Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows	2018	VLDB	9.9665955e-05
2,007	Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs	2015	VLDB	9.8081235e-05
2,162	Scalable Subgraph Enumeration in MapReduce	2015	VLDB	9.3964337e-05
2,801	Scalable Distributed Subgraph Enumeration	2017	VLDB	8.0992955e-05
2,910	DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine	2016	SIGMOD	7.9266529e-05
2,997	Subgraph Matching: on Compression and Computation	2018	VLDB	7.7559339e-05
6,835	Adaptive Asynchronous Parallelization of Graph Algorithms	2018	SIGMOD	4.91158e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,801	Scalable Distributed Subgraph Enumeration	2017	VLDB	8.0992955e-05
6,081	Subgraph Matching over Graph Federation	2022	VLDB	5.2208051e-05
7,675	Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale	2022	VLDB	4.6817479e-05
7,004	RAGraph: A Region-Aware Framework for Geo-Distributed Graph Processing	2024	VLDB	4.8656632e-05
651	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018648572
3,641	GPU-Accelerated Subgraph Enumeration on Partitioned Graphs	2020	SIGMOD	6.8884895e-05
1,953	Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows	2018	VLDB	9.9665955e-05
2,910	DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine	2016	SIGMOD	7.9266529e-05
9,089	Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs	2024	SIGMOD	4.39898e-05
5,009	HUGE: An Efficient and Scalable Subgraph Enumeration System	2021	SIGMOD	5.761237e-05