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)
Incoming Non-self Citations Over Time
Authors
- 1. Shixuan Sun (Hong Kong University of Science and Technology)
- 2. Qiong Luo (Hong Kong University of Science and Technology)
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 6 of 56 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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,952 | Efficient GPU-Accelerated Local Subgraph Counting | 2026 | VLDB | 4.9605343e-05 |
| 11,059 | Aquila: A High-Concurrency System for Incremental Graph Query | 2026 | VLDB | 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 |
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,995 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB |
| 2 | 1,907 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 3 | 3,020 | Efficient GPU-Accelerated Subgraph Matching | 2023 | SIGMOD |
| 4 | 3,771 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |
| 5 | 10,817 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 6 | 10,289 | A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] | 2026 | SIGMOD |
| 7 | 1,090 | CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching | 2019 | SIGMOD |
| 8 | 4,099 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 9 | 1,988 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB |
| 10 | 1,180 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB |