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
5856
Venue
SIGMOD
Year
2020
Pagerank
0.00011545768
Overall Rank
1,237 | 91.52%
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 53 citing papers.

Rank Citing Paper Year Venue Pagerank
2,035 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2787188e-05
2,190 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 8.9804702e-05
2,731 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1959181e-05
3,102 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7568687e-05
3,194 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.6491858e-05
3,283 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.56675e-05
4,158 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.8628196e-05
4,563 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6291459e-05
4,722 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.5438628e-05
4,983 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.4127092e-05
5,275 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.2873652e-05
5,639 LpBound: Pessimistic Cardinality Estimation using ℓp-Norms of Degree Sequences 2025 SIGMOD 6.1385102e-05
5,870 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 6.061038e-05
5,938 PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021 SIGMOD 6.0343238e-05
5,942 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.0334209e-05
6,149 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.9581422e-05
6,325 Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation 2021 SIGMOD 5.9125893e-05
6,393 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.8879832e-05
6,463 Data-driven Visual Query Interfaces for Graphs: Past, Present, and (Near) Future 2022 SIGMOD 5.871484e-05
6,521 BG3: A Cost Effective and I/O Efficient Graph Database in ByteDance 2024 SIGMOD 5.8534756e-05
6,866 Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks 2021 VLDB 5.7507099e-05
6,924 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.738697e-05
7,150 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.687428e-05
8,019 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 5.5062157e-05
8,251 Fast Local Subgraph Counting 2024 VLDB 5.4574671e-05
8,478 T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph 2023 SIGMOD 5.4170414e-05
8,513 Galley: Modern Query Optimization for Sparse Tensor Programs 2025 SIGMOD 5.4119882e-05
8,871 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.35418e-05
9,478 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 5.2634238e-05
9,617 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.2434488e-05
9,693 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2351259e-05
9,872 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.2043672e-05
10,027 Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation 2025 VLDB 5.1745962e-05
10,060 TenGraph: A Tensor-Based Graph Query Engine 2024 VLDB 5.166346e-05
10,084 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.1573064e-05
10,204 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 5.093636e-05
10,294 Sublime: Selecting Subgraph Matching Algorithms via Machine Learning 2026 SIGMOD 5.093636e-05
10,312 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.093636e-05
10,354 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 5.093636e-05
10,375 GraphMatch: Subgraph Query Processing on Steroids 2026 SIGMOD 5.093636e-05
10,376 GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries 2026 SIGMOD 5.093636e-05
10,419 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,438 CorrBound: Cardinality Estimation Accounting for Inter- and Intra-relation Correlations 2026 SIGMOD 5.093636e-05
10,524 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 5.093636e-05
10,552 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 5.093636e-05
10,558 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 5.093636e-05
10,564 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 5.093636e-05
10,590 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 5.093636e-05
10,885 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 5.093636e-05
10,952 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.093636e-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
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
264 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00022980015
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
321 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021283186
352 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020375193
431 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018577017
442 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018398144
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017717377
490 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.000175757
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
809 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00013874588
1,006 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012699518
1,036 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012499878
1,058 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012378784
1,102 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012166591
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001179597
1,246 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011504088
1,487 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010615297
1,552 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010379532
2,065 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.2352771e-05
2,112 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.1514258e-05
2,119 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.141144e-05
2,187 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9966682e-05
3,477 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 7.3791229e-05
3,821 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 7.0933895e-05
4,025 Beyond Macrobenchmarks: Microbenchmark-based Graph Database Evaluation 2019 VLDB 6.947875e-05
6,728 BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks 2018 SIGMOD 5.7898807e-05
Previous Page 1 / 1 Next

Semantically Similar Papers