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.00011677799
Overall Rank
1,171 | 92.16%
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 56 citing papers.

Rank Citing Paper Year Venue Pagerank
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,635 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1795762e-05
3,020 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7267183e-05
3,105 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.6278115e-05
3,107 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.6265309e-05
4,099 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.7940875e-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,801 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.3940913e-05
4,882 LpBound: Pessimistic Cardinality Estimation using ℓp-Norms of Degree Sequences 2025 SIGMOD 6.3565046e-05
5,271 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1891764e-05
5,404 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.132986e-05
5,717 Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation 2021 SIGMOD 6.0067263e-05
5,995 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.903845e-05
6,061 PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021 SIGMOD 5.8831543e-05
6,170 BG3: A Cost Effective and I/O Efficient Graph Database in ByteDance 2024 SIGMOD 5.846836e-05
6,245 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.8210521e-05
6,251 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.8179719e-05
6,272 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.8112899e-05
6,578 Data-driven Visual Query Interfaces for Graphs: Past, Present, and (Near) Future 2022 SIGMOD 5.7253513e-05
6,711 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6854796e-05
7,000 Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks 2021 VLDB 5.6080933e-05
7,271 T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph 2023 SIGMOD 5.5530425e-05
7,552 Fast Local Subgraph Counting 2024 VLDB 5.4802093e-05
8,187 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 5.3652509e-05
8,710 Galley: Modern Query Optimization for Sparse Tensor Programs 2025 SIGMOD 5.2705676e-05
8,899 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2401722e-05
8,920 Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds 2025 VLDB 5.2361195e-05
9,059 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.21427e-05
9,684 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.1258854e-05
9,695 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 5.1258854e-05
9,810 Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation 2025 VLDB 5.112328e-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,101 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.068372e-05
10,286 TenGraph: A Tensor-Based Graph Query Engine 2024 VLDB 5.0333144e-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,630 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 4.9605343e-05
10,647 GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries 2026 SIGMOD 4.9605343e-05
10,699 CorrBound: Cardinality Estimation Accounting for Inter- and Intra-relation Correlations 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
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.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
356 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020086045
439 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018247958
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
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,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,502 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010431532
1,565 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010185615
1,860 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.4720431e-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
3,506 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 7.2286203e-05
3,885 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.9282318e-05
4,086 Beyond Macrobenchmarks: Microbenchmark-based Graph Database Evaluation 2019 VLDB 6.7974939e-05
6,829 BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks 2018 SIGMOD 5.6556888e-05
Previous Page 1 / 1 Next

Semantically Similar Papers