DBScholar

Back to papers

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)

Paper ID
4824
Venue
SIGMOD
Year
2014
Pagerank
0.00012499878
Overall Rank
1,036 | 92.90%
DOI
10.1145/2588555.2588557

Incoming Non-self Citations Over Time

Authors

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.

Rank Citing Paper Year Venue Pagerank
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
809 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00013874588
1,006 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012699518
1,102 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012166591
1,237 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011545768
1,246 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011504088
2,065 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.2352771e-05
2,119 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.141144e-05
2,187 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9966682e-05
2,288 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.8025299e-05
2,522 Fractal: A General-Purpose Graph Pattern Mining System 2019 SIGMOD 8.4713567e-05
2,607 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.3489531e-05
2,973 Functional Dependencies for Graphs 2016 SIGMOD 7.9083516e-05
3,102 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7568687e-05
3,821 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 7.0933895e-05
4,158 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.8628196e-05
4,323 TurboGraph++: A Scalable and Fast Graph Analytics System 2018 SIGMOD 6.7608401e-05
4,983 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.4127092e-05
5,296 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.2782852e-05
6,634 An Experimental Evaluation of SimRank-based Similarity Search Algorithms 2017 VLDB 5.8182573e-05
6,924 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.738697e-05
8,113 Capturing Associations in Graphs 2020 VLDB 5.484341e-05
8,179 GraphINC: Graph Pattern Mining at Network Speed 2023 SIGMOD 5.472762e-05
8,809 Adding Counting Quantifiers to Graph Patterns 2016 SIGMOD 5.3655939e-05
9,131 TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database 2023 SIGMOD 5.3184767e-05
9,176 HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs 2024 SIGMOD 5.3081996e-05
10,204 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 5.093636e-05
10,419 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,552 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 5.093636e-05
10,558 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 5.093636e-05
10,919 X-Blossom: Massive Parallelization of Graph Maximum Matching 2025 VLDB 5.093636e-05
10,952 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.093636e-05
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.0012250108
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
352 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020375193
442 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018398144
458 Counting Triangles in Data Streams 2006 PODS 0.0001810876
594 Massive Graph Triangulation 2013 SIGMOD 0.00015979077
2,650 TreeSpan: Efficiently Computing Similarity All-Matching 2012 SIGMOD 8.2920414e-05
Previous Page 1 / 1 Next

Semantically Similar Papers