| 1,278 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00011462905 |
| 2,214 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
9.008953e-05 |
| 2,312 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
8.8466711e-05 |
| 2,689 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
8.317052e-05 |
| 3,229 |
A Learned Sketch for Subgraph Counting |
2021 |
SIGMOD |
7.6920894e-05 |
| 3,396 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
7.5176876e-05 |
| 3,948 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
7.0699328e-05 |
| 4,186 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
6.9091925e-05 |
| 4,693 |
Circinus: Fast Redundancy-Reduced Subgraph Matching |
2023 |
SIGMOD |
6.6231764e-05 |
| 4,702 |
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming |
2021 |
VLDB |
6.6188333e-05 |
| 5,223 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
6.3799903e-05 |
| 5,248 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
6.3687097e-05 |
| 5,353 |
Making Graphs Compact by Lossless Contraction |
2021 |
SIGMOD |
6.3219746e-05 |
| 5,511 |
Subgraph Matching over Graph Federation |
2022 |
VLDB |
6.2563094e-05 |
| 5,615 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
6.2131411e-05 |
| 5,779 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
6.1549096e-05 |
| 5,845 |
Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach |
2024 |
VLDB |
6.1294746e-05 |
| 6,059 |
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding |
2024 |
VLDB |
6.0534485e-05 |
| 6,227 |
Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation |
2021 |
SIGMOD |
6.0093252e-05 |
| 6,546 |
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification |
2023 |
VLDB |
5.9031535e-05 |
| 6,819 |
SUFF: Accelerating Subgraph Matching with Historical Data |
2023 |
VLDB |
5.8222444e-05 |
| 7,038 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
5.7719407e-05 |
| 7,235 |
Extending Graph Patterns with Conditions |
2020 |
SIGMOD |
5.7195408e-05 |
| 7,961 |
Towards Event Prediction in Temporal Graphs |
2022 |
VLDB |
5.5727796e-05 |
| 7,981 |
Capturing Associations in Graphs |
2020 |
VLDB |
5.5692809e-05 |
| 8,117 |
Fast Local Subgraph Counting |
2024 |
VLDB |
5.5419908e-05 |
| 9,305 |
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework |
2024 |
SIGMOD |
5.3496275e-05 |
| 9,555 |
T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph |
2023 |
SIGMOD |
5.316206e-05 |
| 9,714 |
MatCo: Computing Match Cover of Subgraph Query over Graph Data |
2025 |
SIGMOD |
5.2849709e-05 |
| 9,717 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
5.2849709e-05 |
| 9,933 |
MAVIS: Materialized View for Subgraph Matching |
2026 |
SIGMOD |
5.2371813e-05 |
| 9,936 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
5.2356043e-05 |
| 10,014 |
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,084 |
GraphMatch: Subgraph Query Processing on Steroids |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,096 |
NeuSO: Neural Optimizer for Subgraph Queries |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,139 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,163 |
Enumerating Graph Pattern Matches with ML Oracles |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,236 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs |
2026 |
VLDB |
5.1725247e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
2026 |
VLDB |
5.1725247e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
5.1725247e-05 |
| 10,276 |
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs |
2026 |
VLDB |
5.1725247e-05 |
| 10,312 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
5.1725247e-05 |
| 10,320 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
2026 |
VLDB |
5.1725247e-05 |
| 10,523 |
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns |
2025 |
SIGMOD |
5.1725247e-05 |
| 10,640 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
5.1725247e-05 |
| 10,704 |
S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics |
2025 |
VLDB |
5.1725247e-05 |
| 10,715 |
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences |
2025 |
VLDB |
5.1725247e-05 |
| 10,740 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
5.1725247e-05 |