DBScholar

Back to papers

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)

Paper ID
hbb385eb2c93128d7
Venue
VLDB
Year
2017
Pagerank
9.1729558e-05
Overall Rank
2,020 | 86.43%
DOI
10.14778/3021924.3021928

Incoming Non-self Citations Over Time

Authors

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 32 of 32 citing papers.

Rank Citing Paper Year Venue Pagerank
712 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014578373
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011627669
1,249 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011340141
2,042 Efficient Algorithms for Densest Subgraph Discovery 2019 VLDB 9.1416822e-05
2,166 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9334874e-05
2,468 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.4178183e-05
2,518 Fractal: A General-Purpose Graph Pattern Mining System 2019 SIGMOD 8.3533785e-05
2,634 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1993804e-05
2,774 GraphScope: A Unified Engine For Big Graph Processing 2021 VLDB 8.0327008e-05
3,011 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7549462e-05
3,164 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5771124e-05
3,880 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.9510799e-05
4,075 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8188389e-05
4,123 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7927568e-05
4,511 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.5681258e-05
5,396 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.1494643e-05
5,672 Subgraph Matching over Graph Federation 2022 VLDB 6.0433033e-05
6,515 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.7590881e-05
6,965 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6328006e-05
7,248 Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale 2022 VLDB 5.5746656e-05
9,361 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1868213e-05
9,659 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 5.1453267e-05
9,715 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.1359137e-05
10,253 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.050482e-05
10,254 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.050482e-05
10,258 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.050482e-05
10,420 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9793485e-05
10,708 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 4.9793485e-05
10,740 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9793485e-05
10,788 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9793485e-05
11,053 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.9793485e-05
11,286 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 4.9793485e-05
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