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.00011622165
Overall Rank
1,180 | 92.08%
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,901 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4014537e-05
2,017 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1788573e-05
2,635 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1954989e-05
3,012 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7512751e-05
3,161 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.5771609e-05
3,165 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5735255e-05
4,077 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8156109e-05
4,124 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7895411e-05
4,512 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.5650165e-05
4,783 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.4133399e-05
4,854 LpBound: Pessimistic Cardinality Estimation using ℓp-Norms of Degree Sequences 2025 SIGMOD 6.3775929e-05
5,383 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1533182e-05
5,426 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1332147e-05
5,904 Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation 2021 SIGMOD 5.9511271e-05
5,984 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.9234316e-05
6,047 PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021 SIGMOD 5.9026722e-05
6,155 BG3: A Cost Effective and I/O Efficient Graph Database in ByteDance 2024 SIGMOD 5.8662334e-05
6,235 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.8403639e-05
6,506 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.758981e-05
6,517 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.7563618e-05
6,568 Data-driven Visual Query Interfaces for Graphs: Past, Present, and (Near) Future 2022 SIGMOD 5.7443457e-05
6,966 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6301341e-05
6,981 Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks 2021 VLDB 5.6266987e-05
7,253 T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph 2023 SIGMOD 5.5714652e-05
7,535 Fast Local Subgraph Counting 2024 VLDB 5.4983904e-05
8,185 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 5.3801229e-05
8,690 Galley: Modern Query Optimization for Sparse Tensor Programs 2025 SIGMOD 5.2880532e-05
8,900 Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds 2025 VLDB 5.2534908e-05
9,038 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.2315688e-05
9,368 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1843659e-05
9,657 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.142891e-05
9,666 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 5.142891e-05
9,804 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1233734e-05
10,067 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.0851868e-05
10,221 Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation 2025 VLDB 5.0560976e-05
10,258 TenGraph: A Tensor-Based Graph Query Engine 2024 VLDB 5.0489964e-05
10,259 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.0480912e-05
10,260 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.0480912e-05
10,264 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.0480912e-05
10,276 GraphMatch: Subgraph Query Processing on Steroids 2026 SIGMOD 5.0461162e-05
10,305 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.0392037e-05
10,432 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9769913e-05
10,517 Sublime: Selecting Subgraph Matching Algorithms via Machine Learning 2026 SIGMOD 4.9769913e-05
10,566 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 4.9769913e-05
10,584 GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries 2026 SIGMOD 4.9769913e-05
10,638 CorrBound: Cardinality Estimation Accounting for Inter- and Intra-relation Correlations 2026 SIGMOD 4.9769913e-05
10,718 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 4.9769913e-05
10,744 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9769913e-05
10,750 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9769913e-05
10,756 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 4.9769913e-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.00024899872
239 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00023499655
289 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021960834
315 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021236408
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020116134
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018278591
443 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018190518
466 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00017765702
489 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017440023
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015048943
713 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014571507
961 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012830477
1,042 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012331317
1,046 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012316579
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012007739
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011621825
1,252 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011334813
1,507 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010447258
1,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.0001019315
1,853 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.499042e-05
2,022 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1686153e-05
2,102 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0433983e-05
2,168 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9292584e-05
3,506 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 7.246695e-05
3,881 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.9477894e-05
4,071 Beyond Macrobenchmarks: Microbenchmark-based Graph Database Evaluation 2019 VLDB 6.8182854e-05
6,816 BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks 2018 SIGMOD 5.6718083e-05
Previous Page 1 / 1 Next

Semantically Similar Papers