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.7940875e-05
Overall Rank
4,099 | 72.53%
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 23 of 23 citing papers.

Rank Citing Paper Year Venue Pagerank
6,711 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6854796e-05
8,899 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2401722e-05
9,837 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1064323e-05
9,881 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.1043481e-05
9,882 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.1043481e-05
10,289 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.031399e-05
10,303 GraphMatch: Subgraph Query Processing on Steroids 2026 SIGMOD 5.0294306e-05
10,333 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.0225409e-05
10,379 Algebraic Subgraph Counting 2027 SIGMOD 4.9605343e-05
10,498 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9605343e-05
10,583 Sublime: Selecting Subgraph Matching Algorithms via Machine Learning 2026 SIGMOD 4.9605343e-05
10,712 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 4.9605343e-05
10,779 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 4.9605343e-05
10,805 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9605343e-05
10,811 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9605343e-05
10,817 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 4.9605343e-05
10,859 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9605343e-05
10,871 MGRAG: Semantic Subgraph Matching and Graph-Aware Caching for Multimodal Retrieval-Augmented Generation 2026 VLDB 4.9605343e-05
10,888 A Unified Query Planning Framework for Conjunctive Regular Path Queries 2026 VLDB 4.9605343e-05
11,123 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.9605343e-05
11,270 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 4.9605343e-05
11,349 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 4.9605343e-05
11,491 Mix & Match: Subgraph Matching for Absolute Coverage 2025 VLDB 4.9605343e-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.0012089097
176 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00026634326
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024929198
235 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00023701614
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022009138
318 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021178303
397 Worst-case Optimal Join Algorithms 2012 PODS 0.0001911958
440 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018235529
467 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00017740891
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017479773
658 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015032442
706 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014622696
734 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00014334121
942 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012936571
952 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012878316
1,046 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012315969
1,049 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012293903
1,090 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012062682
1,171 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011677799
1,180 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011600363
1,253 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011316982
1,565 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010185615
1,907 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.379165e-05
1,988 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2301018e-05
2,023 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1568397e-05
2,101 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0309825e-05
2,128 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9879343e-05
2,226 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 8.7971869e-05
2,480 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.387452e-05
2,528 Fractal: A General-Purpose Graph Pattern Mining System 2019 SIGMOD 8.3237453e-05
2,594 GraphScope: A Unified Engine For Big Graph Processing 2021 VLDB 8.2278437e-05
3,020 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7267183e-05
3,107 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.6265309e-05
3,885 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.9282318e-05
4,133 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7738028e-05
4,370 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6213567e-05
4,485 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5644966e-05
4,801 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.3940913e-05
4,835 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3793473e-05
5,404 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.132986e-05
6,536 Big Graph Analytics Systems 2016 SIGMOD 5.7354915e-05
Previous Page 1 / 1 Next

Semantically Similar Papers