Scalable Distributed Subgraph Enumeration
Summary: SEED generalizes distributed subgraph enumeration beyond TwinTwigJoin’s left-deep, star-only plans, using star/clique join units and bushy DP optimization. A power-law-aware cost model, overlap handling, graph storage, and clique compression deliver >10× speedups on billion-edge graphs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Longbin Lai (University of New South Wales)
- 2. Lu Qin (University of Technology Sydney)
- 3. Xuemin Lin (University of New South Wales)
- 4. Ying Zhang (University of Technology Sydney)
- 5. Lijun Chang (University of New South Wales)
- 6. Shiyu Yang (University of New South Wales)
BibTeX Citation
@article{lai_vldb17,
title = {{Scalable Distributed Subgraph Enumeration}},
author = {Lai, Longbin and Qin, Lu and Lin, Xuemin and Zhang, Ying and Chang, Lijun and Yang, Shiyu},
journal = {PVLDB},
series = {{VLDB} '17},
volume = {10},
number = {3},
pages = {217--228},
doi = {10.14778/3021924.3021928},
url = {https://doi.org/10.14778/3021924.3021928},
year = {2017}
}
Incoming Citations (Sorted by Pagerank)
Showing 31 of 31 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 |
|---|---|---|---|---|
| 1 | 3,821 | Distributed Subgraph Matching on Timely Dataflow | 2019 | VLDB |
| 2 | 7,418 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB |
| 3 | 3,008 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD |
| 4 | 2,607 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD |
| 5 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 6 | 1,036 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD |
| 7 | 1,246 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 8 | 9,118 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD |
| 9 | 2,119 | DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine | 2016 | SIGMOD |
| 10 | 1,552 | Scalable Subgraph Enumeration in MapReduce | 2015 | VLDB |