DBScholar

Back to papers

A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction

Summary: Comprehensive survey and experimental study of subgraph matching, examining current trends, unbiased evaluation, and cross-stage interactions under the embedding enumeration framework. Shows backtracking enhancements as a dominant trend, demonstrates powerful bias from output-size limits, and uses embeddings per second to compare 10 techniques per stage across all feasible combinations, and fosters reproducible comparisons across benchmarks. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h8ae47dc60db9e1ba
Venue
SIGMOD
Year
2024
Pagerank
6.8188389e-05
Overall Rank
4,075 | 72.61%
DOI
10.1145/3639315

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhang_sigmod24,
        title = {{A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction}},
        author = {Zhang, Zhijie and Lu, Yujie and Zheng, Weiguo and Lin, Xuemin},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3639315},
        url = {https://dl.acm.org/doi/10.1145/3639315},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 22 of 22 citing papers.

Rank Citing Paper Year Venue Pagerank
6,965 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6328006e-05
9,361 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1868213e-05
9,797 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1257999e-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,270 GraphMatch: Subgraph Query Processing on Steroids 2026 SIGMOD 5.0485061e-05
10,300 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.0415903e-05
10,420 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9793485e-05
10,506 Sublime: Selecting Subgraph Matching Algorithms via Machine Learning 2026 SIGMOD 4.9793485e-05
10,640 Enumerating Graph Pattern Matches with ML Oracles 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
10,746 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 4.9793485e-05
10,788 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9793485e-05
10,800 MGRAG: Semantic Subgraph Matching and Graph-Aware Caching for Multimodal Retrieval-Augmented Generation 2026 VLDB 4.9793485e-05
10,817 A Unified Query Planning Framework for Conjunctive Regular Path Queries 2026 VLDB 4.9793485e-05
11,053 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.9793485e-05
11,203 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 4.9793485e-05
11,286 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 4.9793485e-05
11,432 Mix & Match: Subgraph Matching for Absolute Coverage 2025 VLDB 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 41 of 41 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.0012092602
176 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00026700508
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024884544
239 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.000235107
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
315 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021246
402 Worst-case Optimal Join Algorithms 2012 PODS 0.00019104625
443 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018197688
466 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00017773029
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
712 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014578373
736 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00014363536
937 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012977594
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,045 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012322402
1,046 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012319866
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
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011627329
1,249 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011340141
1,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010197978
1,900 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4059063e-05
2,014 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1832045e-05
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,211 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 8.8237249e-05
2,469 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.4165523e-05
2,518 Fractal: A General-Purpose Graph Pattern Mining System 2019 SIGMOD 8.3533785e-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,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
4,587 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5161686e-05
4,779 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.4163774e-05
4,817 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3985024e-05
5,377 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1562325e-05
6,527 Big Graph Analytics Systems 2016 SIGMOD 5.7555795e-05
Previous Page 1 / 1 Next

Semantically Similar Papers