Database Paper Browser

Back to papers

On Graph Query Optimization in Large Networks

Summary: SPath: a high-performance graph index for large networks built from decomposed shortest paths around vertex neighborhoods. Query planning decomposes the query into candidate paths, selects a subset, and joins them to reconstruct the query graph, enabling scalable path-at-a-time querying and beating vertex-at-a-time and GraphQL baselines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10089
Venue
VLDB
Year
2010
Pagerank
0.00021475362
Overall Rank
506 | 96.49%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 50 of 53 citing papers.

Rank Citing Paper Year Venue Pagerank
651 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018648572
764 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017018712
1,180 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013456907
1,500 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00011674394
1,561 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00011358946
1,635 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001105793
1,775 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00010602927
1,924 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010077055
1,958 Exemplar Queries: Give me an Example of What You Need 2014 VLDB 9.9572632e-05
2,007 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 9.8081235e-05
2,117 Efficient SimRank-based Similarity Join Over Large Graphs 2013 VLDB 9.5155578e-05
2,162 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 9.3964337e-05
2,409 TreeSpan: Efficiently Computing Similarity All-Matching 2012 SIGMOD 8.8776858e-05
2,801 Scalable Distributed Subgraph Enumeration 2017 VLDB 8.0992955e-05
2,912 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 7.9130459e-05
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,211 Natural Language Question Answering over RDF — A Graph Data Driven Approach 2014 SIGMOD 7.3743561e-05
3,639 On Querying Historical Evolving Graph Sequences 2011 VLDB 6.8913642e-05
3,641 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 6.8884895e-05
4,470 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 6.1557462e-05
4,494 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 6.1414196e-05
4,949 Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs 2013 VLDB 5.8113132e-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,854 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 5.3006473e-05
5,877 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 5.2916612e-05
5,926 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 5.271318e-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,498 Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs 2020 SIGMOD 5.0392468e-05
6,971 BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks 2018 SIGMOD 4.8792893e-05
7,100 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 4.8326259e-05
7,257 CAVE: Concurrency-Aware Graph Processing on SSDs 2024 SIGMOD 4.786584e-05
7,307 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 4.7674113e-05
7,641 Extending Graph Patterns with Conditions 2020 SIGMOD 4.6902655e-05
7,863 Adaptive Optimizations of Recursive Queries in Teradata 2012 SIGMOD 4.6328993e-05
7,934 Fast Local Subgraph Counting 2024 VLDB 4.613363e-05
8,070 The shortest path is not always a straight line: Leveraging semi-metricity in graph analysis 2016 VLDB 4.5932982e-05
8,577 RBench: Application-Specific RDF Benchmarking 2015 SIGMOD 4.4926769e-05
8,765 Efficient Query Answering in Probabilistic RDF Graphs 2011 SIGMOD 4.456315e-05
9,518 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 4.3328897e-05
9,580 ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs 2020 VLDB 4.3234342e-05
9,730 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 4.2942813e-05
10,062 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 4.1945683e-05
10,131 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 4.1945683e-05
10,264 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.1945683e-05
Previous Page 1 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers