| 292 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.0002223786 |
| 352 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00020516762 |
| 428 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00018725237 |
| 454 |
Counting Triangles in Data Streams |
2006 |
PODS |
0.00018243292 |
| 487 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017695307 |
| 582 |
Substructure Similarity Search in Graph Databases |
2005 |
SIGMOD |
0.00016196981 |
| 682 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00015144404 |
| 725 |
Graph Indexing: Tree + Delta >= Graph |
2007 |
VLDB |
0.00014708873 |
| 762 |
Distance-Join: Pattern Match Query In a Large Graph Database |
2009 |
VLDB |
0.00014288919 |
| 817 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.0001387659 |
| 1,031 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00012615956 |
| 1,077 |
GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph |
2014 |
VLDB |
0.00012403698 |
| 1,097 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00012273511 |
| 1,099 |
Comparing Stars: On Approximating Graph Edit Distance |
2009 |
VLDB |
0.00012271234 |
| 1,201 |
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases |
2013 |
VLDB |
0.00011794097 |
| 1,221 |
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs |
2010 |
VLDB |
0.00011697627 |
| 1,385 |
Neighborhood Based Fast Graph Search in Large Networks |
2011 |
SIGMOD |
0.00011049625 |
| 1,762 |
gStore: Answering SPARQL Queries via Subgraph Matching |
2011 |
VLDB |
9.8932379e-05 |
| 1,873 |
Exemplar Queries: Give me an Example of What You Need |
2014 |
VLDB |
9.661206e-05 |
| 1,946 |
Mining Significant Graph Patterns by Leap Search |
2008 |
SIGMOD |
9.5137593e-05 |
| 2,302 |
Towards Graph Containment Search and Indexing |
2007 |
VLDB |
8.8685843e-05 |
| 2,312 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
8.8466711e-05 |
| 2,789 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.1864277e-05 |
| 3,263 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
7.6516708e-05 |
| 3,381 |
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques |
2010 |
VLDB |
7.5315403e-05 |
| 3,436 |
Performance and Scalability of Indexed Subgraph Query Processing Methods |
2015 |
VLDB |
7.482297e-05 |
| 3,499 |
Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases |
2012 |
VLDB |
7.4344243e-05 |
| 4,186 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
6.9091925e-05 |
| 4,225 |
Mining Top-K Large Structural Patterns in a Massive Network |
2011 |
VLDB |
6.884256e-05 |
| 4,514 |
Mining Graph Patterns Efficiently via Randomized Summaries |
2009 |
VLDB |
6.7219831e-05 |
| 4,693 |
Circinus: Fast Redundancy-Reduced Subgraph Matching |
2023 |
SIGMOD |
6.6231764e-05 |
| 4,696 |
VOGUE: Towards A Visual Interaction-aware Graph Query Processing Framework |
2013 |
CIDR |
6.6216656e-05 |
| 4,750 |
Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs |
2013 |
VLDB |
6.5980489e-05 |
| 4,782 |
Efficient Subgraph Search over Large Uncertain Graphs |
2011 |
VLDB |
6.578269e-05 |
| 5,200 |
Taming Subgraph Isomorphism for RDF Query Processing |
2015 |
VLDB |
6.3897796e-05 |
| 5,248 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
6.3687097e-05 |
| 5,297 |
Diversified Top-k Subgraph Querying in a Large Graph |
2016 |
SIGMOD |
6.347246e-05 |
| 5,340 |
Towards Proximity Pattern Mining in Large Graphs |
2010 |
SIGMOD |
6.3263757e-05 |
| 5,633 |
Graph-Aware, Workload-Adaptive SPARQL Query Caching |
2015 |
SIGMOD |
6.2047208e-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,430 |
Mining and Indexing Graphs for Supergraph Search |
2013 |
VLDB |
5.9436728e-05 |
| 6,526 |
Updating Graph Indices with a One-Pass Algorithm |
2015 |
SIGMOD |
5.9091036e-05 |
| 6,546 |
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification |
2023 |
VLDB |
5.9031535e-05 |
| 6,973 |
CAVE: Concurrency-Aware Graph Processing on SSDs |
2024 |
SIGMOD |
5.7955627e-05 |
| 7,390 |
Efficient Indexing and Querying over Syntactically Annotated Trees |
2012 |
VLDB |
5.6897772e-05 |
| 7,697 |
Periscope/GQ: A Graph Querying Toolkit |
2008 |
VLDB |
5.6226144e-05 |
| 8,457 |
A Framework for Privacy Preserving Localized Graph Pattern Query Processing |
2023 |
SIGMOD |
5.4910673e-05 |
| 8,759 |
GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases |
2010 |
SIGMOD |
5.4338813e-05 |
| 9,359 |
FIX: Feature-based Indexing Technique for XML Documents |
2006 |
VLDB |
5.3426031e-05 |