| 202 |
Graph Indexing: A Frequent Structure-based Approach |
2004 |
SIGMOD |
0.00034881375 |
| 327 |
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing |
2018 |
VLDB |
0.00027312381 |
| 460 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022679846 |
| 502 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00021528261 |
| 530 |
The LDBC Social Network Benchmark: Interactive Workload |
2015 |
SIGMOD |
0.00020823189 |
| 616 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00019068362 |
| 749 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017193776 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,334 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00012543633 |
| 1,487 |
Parallel Subgraph Listing in a Large-Scale Graph |
2014 |
SIGMOD |
0.00011691164 |
| 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 |
| 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,199 |
gStore: Answering SPARQL Queries via Subgraph Matching |
2011 |
VLDB |
9.3082437e-05 |
| 2,402 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.87387e-05 |
| 2,962 |
Kuzu* Graph Database Management System |
2023 |
CIDR |
7.8069285e-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 |
| 4,326 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.2772512e-05 |
| 5,002 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.7610359e-05 |
| 5,502 |
Circinus: Fast Redundancy-Reduced Subgraph Matching |
2023 |
SIGMOD |
5.4730826e-05 |
| 5,871 |
Taming Subgraph Isomorphism for RDF Query Processing |
2015 |
VLDB |
5.2912806e-05 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |
| 6,283 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
5.1234789e-05 |
| 7,091 |
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification |
2023 |
VLDB |
4.8304411e-05 |
| 7,456 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
4.7205339e-05 |