DBScholar

Back to papers

On Graph Query Optimization in Large Networks

Summary: SPath indexes large graphs using decomposed shortest paths around vertex neighborhoods, enabling scalable pruning and construction. Its optimizer shifts subgraph matching from vertex-at-a-time to selective path-at-a-time decomposition and joins, outperforming GraphQL on real and synthetic networks. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
h4e882d63e732865d
Venue
VLDB
Year
2010
Pagerank
0.00020116134
Overall Rank
355 | 97.62%
DOI
10.14778/1920841.1920887

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{zhao_vldb10,
        title = {{On Graph Query Optimization in Large Networks}},
        author = {Zhao, Peixiang and Han, Jiawei},
        journal = {PVLDB},
        series = {{VLDB} '10},
        volume = {3},
        number = {1},
        pages = {340--351},
        doi = {10.14778/1920841.1920887},
        url = {https://doi.org/10.14778/1920841.1920887},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 50 of 54 citing papers.

Rank Citing Paper Year Venue Pagerank
443 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018190518
489 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017440023
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015048943
961 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012830477
1,042 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012331317
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012007739
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011622165
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011621825
1,507 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010447258
1,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.0001019315
1,866 Efficient SimRank-based Similarity Join Over Large Graphs 2013 VLDB 9.4779341e-05
1,901 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4014537e-05
1,955 Exemplar Queries: Give me an Example of What You Need 2014 VLDB 9.3136735e-05
2,017 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1788573e-05
2,022 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1686153e-05
2,212 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 8.8195478e-05
2,468 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.4138334e-05
2,635 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1954989e-05
2,701 TreeSpan: Efficiently Computing Similarity All-Matching 2012 SIGMOD 8.114832e-05
3,012 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7512751e-05
3,165 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5735255e-05
3,662 On Querying Historical Evolving Graph Sequences 2011 VLDB 7.1164957e-05
3,769 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 7.0282248e-05
4,081 Natural Language Question Answering over RDF — A Graph Data Driven Approach 2014 SIGMOD 6.8149231e-05
4,124 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7895411e-05
4,512 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.5650165e-05
4,783 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.4133399e-05
4,819 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3954734e-05
4,916 Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs 2013 VLDB 6.3530391e-05
5,383 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1533182e-05
5,481 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 6.1126446e-05
5,984 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.9234316e-05
6,235 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.8403639e-05
6,305 Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs 2020 SIGMOD 5.8161222e-05
6,506 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.758981e-05
6,517 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.7563618e-05
6,622 CAVE: Concurrency-Aware Graph Processing on SSDs 2024 SIGMOD 5.7300723e-05
6,816 BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks 2018 SIGMOD 5.6718083e-05
7,483 Extending Graph Patterns with Conditions 2020 SIGMOD 5.5124816e-05
7,535 Fast Local Subgraph Counting 2024 VLDB 5.4983904e-05
8,049 Adaptive Optimizations of Recursive Queries in Teradata 2012 SIGMOD 5.3988942e-05
8,421 The shortest path is not always a straight line: Leveraging semi-metricity in graph analysis 2016 VLDB 5.3327977e-05
8,743 RBench: Application-Specific RDF Benchmarking 2015 SIGMOD 5.2880447e-05
9,107 Efficient Query Answering in Probabilistic RDF Graphs 2011 SIGMOD 5.2258409e-05
9,368 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1843659e-05
9,657 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.142891e-05
9,720 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.1334824e-05
9,847 ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs 2020 VLDB 5.1206606e-05
10,067 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.0851868e-05
10,251 Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query 2020 SIGMOD 5.0501823e-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.

Rank Cited Paper Year Venue Pagerank
176 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00026688651
193 Algorithmics and Applications of Tree and Graph Searching 2002 PODS 0.00025647819
270 BLINKS: Ranked Keyword Searches on Graphs 2007 SIGMOD 0.00022588961
274 3-HOP: A High-Compression Indexing Scheme for Reachability Query 2009 SIGMOD 0.00022480767
289 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021960834
293 Bidirectional Expansion For Keyword Search on Graph Databases 2005 VLDB 0.00021933539
330 Fast and Practical Indexing and Querying of Very Large Graphs 2007 SIGMOD 0.00020828552
332 FG-Index: Towards Verification-Free Query Processing on Graph Databases 2007 SIGMOD 0.00020756016
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018278591
737 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00014357361
776 Efficiently Answering Reachability Queries on Very Large Directed Graphs 2008 SIGMOD 0.00014076975
784 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00014015324
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 8,668 Top-K Nearest Keyword Search on Large Graphs 2013 VLDB
2 776 Efficiently Answering Reachability Queries on Very Large Directed Graphs 2008 SIGMOD
3 3,936 Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach 2012 SIGMOD
4 3,506 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB
5 8,421 The shortest path is not always a straight line: Leveraging semi-metricity in graph analysis 2016 VLDB
6 443 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB
7 5,343 Efficient Shortest Path Counting on Large Road Networks 2022 VLDB
8 5,804 Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement 2022 VLDB
9 4,140 Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs 2016 SIGMOD
10 5,897 Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks 2021 SIGMOD