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 |
|---|---|---|---|---|
| 3,749 | Distributed Subgraph Matching on Timely Dataflow | 2019 | VLDB | 7.2091565e-05 |
| 7,285 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB | 5.7107054e-05 |
| 2,985 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.9430737e-05 |
| 2,827 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD | 8.1346366e-05 |
| 434 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018612924 |
| 1,048 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD | 0.00012532323 |
| 1,336 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB | 0.00011216887 |
| 8,984 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD | 5.4025283e-05 |
| 2,142 | DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine | 2016 | SIGMOD | 9.1646667e-05 |
| 1,566 | Scalable Subgraph Enumeration in MapReduce | 2015 | VLDB | 0.00010397786 |