DBScholar

Back to papers

In-Memory Subgraph Matching: An In-depth Study

Summary: Eight in-memory subgraph-matchers are compared in a common framework across filtering, ordering, enumeration, and optimizations. Findings: GraphQL filtering is competitive; RI ordering is strong; DP-iso pruning helps large queries; code available. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h0309cce04b2ef0b6
Venue
SIGMOD
Year
2020
Pagerank
0.00011627669
Overall Rank
1,180 | 92.07%
DOI
10.1145/3318464.3380581

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{sun_sigmod20,
        title = {{In-Memory Subgraph Matching: An In-depth Study}},
        author = {Sun, Shixuan and Luo, Qiong},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3380581},
        url = {https://dl.acm.org/doi/10.1145/3318464.3380581},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 50 of 55 citing papers.

Rank Citing Paper Year Venue Pagerank
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,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,160 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.5807496e-05
3,164 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5771124e-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
4,779 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.4163774e-05
4,852 LpBound: Pessimistic Cardinality Estimation using ℓp-Norms of Degree Sequences 2025 SIGMOD 6.3806134e-05
5,377 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1562325e-05
5,422 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1361195e-05
5,901 Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation 2021 SIGMOD 5.9539374e-05
5,984 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.926237e-05
6,045 PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021 SIGMOD 5.9054678e-05
6,153 BG3: A Cost Effective and I/O Efficient Graph Database in ByteDance 2024 SIGMOD 5.8690117e-05
6,232 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.84313e-05
6,504 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.7617085e-05
6,515 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.7590881e-05
6,566 Data-driven Visual Query Interfaces for Graphs: Past, Present, and (Near) Future 2022 SIGMOD 5.7470663e-05
6,965 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6328006e-05
6,978 Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks 2021 VLDB 5.6293636e-05
7,251 T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph 2023 SIGMOD 5.574104e-05
7,529 Fast Local Subgraph Counting 2024 VLDB 5.5009945e-05
8,178 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 5.382671e-05
8,682 Galley: Modern Query Optimization for Sparse Tensor Programs 2025 SIGMOD 5.2905577e-05
8,891 Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds 2025 VLDB 5.2559789e-05
9,030 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.2340466e-05
9,361 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1868213e-05
9,650 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.1453267e-05
9,659 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 5.1453267e-05
9,797 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1257999e-05
10,062 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.0875952e-05
10,215 Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation 2025 VLDB 5.0584922e-05
10,251 TenGraph: A Tensor-Based Graph Query Engine 2024 VLDB 5.0513876e-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,555 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 4.9793485e-05
10,573 GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries 2026 SIGMOD 4.9793485e-05
10,627 CorrBound: Cardinality Estimation Accounting for Inter- and Intra-relation Correlations 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
Previous Page 1 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 27 of 27 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
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
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020124083
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018286607
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
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,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,506 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010452205
1,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010197978
2,019 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.1750421e-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
3,506 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 7.2501249e-05
3,880 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.9510799e-05
4,068 Beyond Macrobenchmarks: Microbenchmark-based Graph Database Evaluation 2019 VLDB 6.8215122e-05
6,811 BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks 2018 SIGMOD 5.6744946e-05
Previous Page 1 / 1 Next

Semantically Similar Papers