| 3,001 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
7.7404487e-05 |
| 3,036 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6735171e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 3,778 |
A Learned Sketch for Subgraph Counting |
2021 |
SIGMOD |
6.7747398e-05 |
| 4,470 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.1557462e-05 |
| 4,968 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.7956205e-05 |
| 5,009 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.761237e-05 |
| 5,499 |
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming |
2021 |
VLDB |
5.4750222e-05 |
| 5,728 |
Circinus: Fast Redundancy-Reduced Subgraph Matching |
2023 |
SIGMOD |
5.3507988e-05 |
| 5,926 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
5.271318e-05 |
| 6,208 |
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration |
2021 |
SIGMOD |
5.1568586e-05 |
| 6,281 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.128862e-05 |
| 6,289 |
Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach |
2024 |
VLDB |
5.1275309e-05 |
| 6,395 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
5.0829204e-05 |
| 6,441 |
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding |
2024 |
VLDB |
5.0603113e-05 |
| 6,609 |
Data-driven Visual Query Interfaces for Graphs: Past, Present, and (Near) Future |
2022 |
SIGMOD |
4.9956718e-05 |
| 6,704 |
Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation |
2021 |
SIGMOD |
4.9554912e-05 |
| 6,969 |
LpBound: Pessimistic Cardinality Estimation using ℓp-Norms of Degree Sequences |
2025 |
SIGMOD |
4.8799937e-05 |
| 7,100 |
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification |
2023 |
VLDB |
4.8326259e-05 |
| 7,307 |
SUFF: Accelerating Subgraph Matching with Historical Data |
2023 |
VLDB |
4.7674113e-05 |
| 7,375 |
BG3: A Cost Effective and I/O Efficient Graph Database in ByteDance |
2024 |
SIGMOD |
4.7491278e-05 |
| 7,883 |
Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks |
2021 |
VLDB |
4.6282138e-05 |
| 7,934 |
Fast Local Subgraph Counting |
2024 |
VLDB |
4.613363e-05 |
| 8,031 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
4.6018906e-05 |
| 8,279 |
Galley: Modern Query Optimization for Sparse Tensor Programs |
2025 |
SIGMOD |
4.5435639e-05 |
| 8,809 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
4.4443756e-05 |
| 9,330 |
Parallel Query Processing: To Separate Communication from Computation |
2022 |
SIGMOD |
4.3556432e-05 |
| 9,561 |
T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph |
2023 |
SIGMOD |
4.3254416e-05 |
| 9,727 |
MatCo: Computing Match Cover of Subgraph Query over Graph Data |
2025 |
SIGMOD |
4.2942813e-05 |
| 9,730 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
4.2942813e-05 |
| 9,877 |
Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation |
2025 |
VLDB |
4.2656547e-05 |
| 9,916 |
TenGraph: A Tensor-Based Graph Query Engine |
2024 |
VLDB |
4.2561557e-05 |
| 9,934 |
MAVIS: Materialized View for Subgraph Matching |
2026 |
SIGMOD |
4.2496728e-05 |
| 10,014 |
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,084 |
GraphMatch: Subgraph Query Processing on Steroids |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,085 |
GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,096 |
NeuSO: Neural Optimizer for Subgraph Queries |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,149 |
CorrBound: Cardinality Estimation Accounting for Inter- and Intra-relation Correlations |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,236 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs |
2026 |
VLDB |
4.1945683e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
2026 |
VLDB |
4.1945683e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1945683e-05 |
| 10,292 |
Aquila: A High-Concurrency System for Incremental Graph Query |
2026 |
VLDB |
4.1945683e-05 |
| 10,632 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 10,708 |
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences |
2025 |
VLDB |
4.1945683e-05 |
| 10,733 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 10,848 |
Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds |
2025 |
VLDB |
4.1945683e-05 |
| 10,851 |
Mix & Match: Subgraph Matching for Absolute Coverage |
2025 |
VLDB |
4.1945683e-05 |
| 10,948 |
gSWORD: GPU-accelerated Sampling for Subgraph Counting |
2024 |
SIGMOD |
4.1945683e-05 |