Scalable Distributed Subgraph Enumeration
Summary: SEED: scalable distributed subgraph enumeration; generalizes left-deep joins to include clique joins. Power-law aware cost model, DP-based bushy join planning, overlap handling, clique compression; large-scale gains vs TwinTwigJoin. (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. Ying Zhang
- 5. Lijun Chang
- 6. Shiyu Yang
Incoming Citations (Sorted by Pagerank)
Showing 30 of 30 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 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,556 | Distributed Subgraph Matching on Timely Dataflow | 2019 | VLDB | 6.0883757e-05 |
| 7,675 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB | 4.6817479e-05 |
| 3,129 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.5008242e-05 |
| 3,641 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD | 6.8884895e-05 |
| 651 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018648572 |
| 1,500 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD | 0.00011674394 |
| 1,953 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB | 9.9665955e-05 |
| 9,089 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD | 4.39898e-05 |
| 2,910 | DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine | 2016 | SIGMOD | 7.9266529e-05 |
| 2,162 | Scalable Subgraph Enumeration in MapReduce | 2015 | VLDB | 9.3964337e-05 |