| 1,180 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00011627669 |
| 2,014 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
9.1832045e-05 |
| 2,469 |
Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU |
2020 |
VLDB |
8.4165523e-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,587 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
6.5161686e-05 |
| 4,779 |
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming |
2021 |
VLDB |
6.4163774e-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,554 |
Making Graphs Compact by Lossless Contraction |
2021 |
SIGMOD |
6.0858703e-05 |
| 5,558 |
I/O-Efficient Butterfly Counting at Scale |
2023 |
SIGMOD |
6.0850942e-05 |
| 5,672 |
Subgraph Matching over Graph Federation |
2022 |
VLDB |
6.0433033e-05 |
| 5,880 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
5.9612878e-05 |
| 5,984 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
5.926237e-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,965 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
5.6328006e-05 |
| 7,478 |
Extending Graph Patterns with Conditions |
2020 |
SIGMOD |
5.5150923e-05 |
| 7,529 |
Fast Local Subgraph Counting |
2024 |
VLDB |
5.5009945e-05 |
| 7,747 |
RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs |
2021 |
VLDB |
5.4601389e-05 |
| 8,293 |
Capturing Associations in Graphs |
2020 |
VLDB |
5.3612871e-05 |
| 9,030 |
MatCo: Computing Match Cover of Subgraph Query over Graph Data |
2025 |
SIGMOD |
5.2340466e-05 |
| 9,148 |
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework |
2024 |
SIGMOD |
5.2189946e-05 |
| 9,361 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
5.1868213e-05 |
| 9,568 |
S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics |
2025 |
VLDB |
5.1571823e-05 |
| 9,650 |
gSWORD: GPU-accelerated Sampling for Subgraph Counting |
2024 |
SIGMOD |
5.1453267e-05 |
| 9,797 |
NeuSO: Neural Optimizer for Subgraph Queries |
2026 |
SIGMOD |
5.1257999e-05 |
| 9,912 |
FusionQuery: On-demand Fusion Queries over Multi-source Heterogeneous Data |
2024 |
VLDB |
5.1103839e-05 |
| 10,062 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
5.0875952e-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,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,617 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,640 |
Enumerating Graph Pattern Matches with ML Oracles |
2026 |
SIGMOD |
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 |
| 10,788 |
Subgraph Enumeration: Beyond Tree Decomposition |
2026 |
VLDB |
4.9793485e-05 |
| 10,989 |
Aquila: A High-Concurrency System for Incremental Graph Query |
2026 |
VLDB |
4.9793485e-05 |
| 11,053 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
2026 |
VLDB |
4.9793485e-05 |