| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 1,715 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010776518 |
| 1,906 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010135267 |
| 1,948 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9938634e-05 |
| 1,973 |
Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions |
2018 |
SIGMOD |
9.8834701e-05 |
| 2,021 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.7730473e-05 |
| 2,172 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.37776e-05 |
| 2,728 |
Keys for Graphs |
2015 |
VLDB |
8.2228869e-05 |
| 2,787 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.1219297e-05 |
| 2,882 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
7.9666138e-05 |
| 2,988 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
7.7752463e-05 |
| 3,034 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6737281e-05 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 3,488 |
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs |
2020 |
SIGMOD |
7.0460627e-05 |
| 3,864 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
6.6813849e-05 |
| 4,326 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.2772512e-05 |
| 4,460 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1592411e-05 |
| 4,486 |
Multi-Query Optimization for Subgraph Isomorphism Search |
2017 |
VLDB |
6.1413967e-05 |
| 4,554 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0839934e-05 |
| 4,756 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.9364786e-05 |
| 5,002 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.7610359e-05 |
| 5,030 |
Making Graphs Compact by Lossless Contraction |
2021 |
SIGMOD |
5.7445683e-05 |
| 5,490 |
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming |
2021 |
VLDB |
5.4788004e-05 |
| 5,502 |
Circinus: Fast Redundancy-Reduced Subgraph Matching |
2023 |
SIGMOD |
5.4730826e-05 |
| 5,530 |
Efficient Streaming Subgraph Isomorphism with Graph Neural Networks |
2021 |
VLDB |
5.4562393e-05 |
| 5,809 |
Fast and Robust Distributed Subgraph Enumeration |
2019 |
VLDB |
5.3175972e-05 |
| 5,871 |
Taming Subgraph Isomorphism for RDF Query Processing |
2015 |
VLDB |
5.2912806e-05 |
| 5,903 |
Diversified Top-k Subgraph Querying in a Large Graph |
2016 |
SIGMOD |
5.2757528e-05 |
| 5,921 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
5.2681722e-05 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |
| 6,005 |
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra |
2021 |
VLDB |
5.2365238e-05 |
| 6,086 |
Subgraph Matching over Graph Federation |
2022 |
VLDB |
5.2157921e-05 |
| 6,288 |
Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach |
2024 |
VLDB |
5.1226099e-05 |
| 6,391 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
5.0780425e-05 |
| 6,436 |
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding |
2024 |
VLDB |
5.0554554e-05 |
| 6,965 |
BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks |
2018 |
SIGMOD |
4.8759021e-05 |
| 7,091 |
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification |
2023 |
VLDB |
4.8304411e-05 |
| 7,179 |
A Hierarchical Contraction Scheme for Querying Big Graphs |
2022 |
SIGMOD |
4.803776e-05 |
| 7,304 |
SUFF: Accelerating Subgraph Matching with Historical Data |
2023 |
VLDB |
4.7628386e-05 |
| 7,456 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
4.7205339e-05 |
| 7,566 |
Extending Graph Patterns with Conditions |
2020 |
SIGMOD |
4.7047078e-05 |
| 7,761 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4.6543114e-05 |
| 7,936 |
Fast Local Subgraph Counting |
2024 |
VLDB |
4.6089395e-05 |
| 9,375 |
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework |
2024 |
SIGMOD |
4.3452177e-05 |
| 9,729 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
4.2901665e-05 |
| 9,766 |
View-based Explanations for Graph Neural Networks |
2024 |
SIGMOD |
4.2815042e-05 |
| 9,791 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
4.2777144e-05 |
| 9,861 |
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs |
2020 |
VLDB |
4.2642656e-05 |
| 9,886 |
Graph Exploration: From Users to Large Graphs |
2017 |
SIGMOD |
4.2580321e-05 |