DBScholar

Back to papers

Scalable Subgraph Enumeration in MapReduce

Summary: MapReduce-based subgraph enumeration via TwinTwigJoin, a left-deep-join framework using TwinTwig units (edge or two incident edges). Instance-optimal under ER graphs with an optimal join plan; three optimizations; adaptable to power-law graphs; extensive experiments on real graphs with billions of edges show substantial gains over prior approaches. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h6387f97740d72876
Venue
VLDB
Year
2015
Pagerank
0.00010197978
Overall Rank
1,572 | 89.44%
DOI
10.14778/2794367.2794368

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{lai_vldb15,
        title = {{Scalable Subgraph Enumeration in MapReduce}},
        author = {Lai, Longbin and Qin, Lu and Lin, Xuemin and Chang, Lijun},
        journal = {PVLDB},
        series = {{VLDB} '15},
        volume = {8},
        number = {10},
        pages = {974--985},
        doi = {10.14778/2794367.2794368},
        url = {https://doi.org/10.14778/2794367.2794368},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 38 of 38 citing papers.

Rank Citing Paper Year Venue Pagerank
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012013426
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011627669
2,020 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1729558e-05
2,101 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0476814e-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,469 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.4165523e-05
2,634 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1993804e-05
3,011 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7549462e-05
3,026 Functional Dependencies for Graphs 2016 SIGMOD 7.7387829e-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,285 TurboGraph++: A Scalable and Fast Graph Analytics System 2018 SIGMOD 6.688615e-05
5,396 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.1494643e-05
5,477 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 6.1155396e-05
5,558 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 6.0850942e-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,529 Fast Local Subgraph Counting 2024 VLDB 5.5009945e-05
9,296 TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database 2023 SIGMOD 5.1991444e-05
9,659 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 5.1453267e-05
10,127 A Modular Graph-Native Query Optimization Framework 2025 SIGMOD 5.0751052e-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,734 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 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
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
11,546 Towards a Converged Relational-Graph Optimization Framework 2024 SIGMOD 4.9793485e-05
12,210 Catching Numeric Inconsistencies in Graphs 2018 SIGMOD 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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