Parallel Subgraph Listing in a Large-Scale Graph
Summary: PSgL enables parallel subgraph listing via a traversal-based divide-and-conquer framework, avoiding expensive joins. Uses workload-balancing heuristics, automorphism breaking, and pruning with a light-weight index, delivering up to 90% speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yingxia Shao (Peking University)
- 2. Bin Cui (Peking University)
- 3. Lei Chen (Hong Kong University of Science and Technology)
- 4. Lin Ma (Peking University)
- 5. Junjie Yao (Peking University)
- 6. Ning Xu (Peking University)
BibTeX Citation
@inproceedings{shao_sigmod14,
title = {{Parallel Subgraph Listing in a Large-Scale Graph}},
author = {Shao, Yingxia and Cui, Bin and Chen, Lei and Ma, Lin and Yao, Junjie and Xu, Ning},
series = {{SIGMOD} '14},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2588555.2588557},
url = {https://dl.acm.org/doi/10.1145/2588555.2588557},
year = {2014}
}
Incoming Citations (Sorted by Pagerank)
Showing 32 of 32 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012087459 |
| 289 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00021960834 |
| 355 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00020116134 |
| 443 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018190518 |
| 463 | Counting Triangles in Data Streams | 2006 | PODS | 0.00017799662 |
| 600 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015733864 |
| 2,701 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD | 8.114832e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,721 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB |
| 2 | 1,863 | Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation | 2015 | VLDB |
| 3 | 6,655 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB |
| 4 | 443 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 5 | 1,252 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 6 | 5,481 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 7 | 3,690 | Parallel Local Graph Clustering | 2016 | VLDB |
| 8 | 2,468 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD |
| 9 | 2,102 | DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine | 2016 | SIGMOD |
| 10 | 10,750 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB |