Scalable Subgraph Enumeration in MapReduce
Summary: MapReduce-based subgraph enumeration via TwinTwigJoin, a left-deep-join framework using TwinTwig units (edge or two incident edges). Instance-optimal under ER graphs with an optimal join plan; three optimizations; adaptable to power-law graphs; extensive experiments on real graphs with billions of edges show substantial gains over prior approaches. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Longbin Lai
- 2. Lu Qin
- 3. Xuemin Lin
- 4. Lijun Chang
Incoming Citations (Sorted by Pagerank)
Showing 37 of 37 citing papers.
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 |
|---|---|---|---|---|
| 4,775 | Set Similarity Joins on MapReduce: An Experimental Survey | 2018 | VLDB | 5.9315784e-05 |
| 3,703 | Multi-Query Optimization in MapReduce Framework | 2014 | VLDB | 6.8289978e-05 |
| 1,500 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD | 0.00011674394 |
| 3,141 | ClusterJoin: A Similarity Joins Framework using Map-Reduce | 2014 | VLDB | 7.4829448e-05 |
| 447 | Efficient Parallel Set-Similarity Joins Using MapReduce | 2010 | SIGMOD | 0.00022900171 |
| 644 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00018748988 |
| 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 |
| 3,129 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.5008242e-05 |
| 2,801 | Scalable Distributed Subgraph Enumeration | 2017 | VLDB | 8.0992955e-05 |