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.00020124083
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.00018197688
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,046 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012319866
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012013426
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011627669
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011627329
1,506 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010452205
1,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010197978
1,864 Efficient SimRank-based Similarity Join Over Large Graphs 2013 VLDB 9.4824224e-05
1,900 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4059063e-05
1,954 Exemplar Queries: Give me an Example of What You Need 2014 VLDB 9.31794e-05
2,014 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1832045e-05
2,020 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1729558e-05
2,211 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 8.8237249e-05
2,468 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.4178183e-05
2,634 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1993804e-05
2,702 TreeSpan: Efficiently Computing Similarity All-Matching 2012 SIGMOD 8.1177147e-05
3,011 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7549462e-05
3,164 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5771124e-05
3,661 On Querying Historical Evolving Graph Sequences 2011 VLDB 7.1198662e-05
3,767 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 7.0315534e-05
4,080 Natural Language Question Answering over RDF — A Graph Data Driven Approach 2014 SIGMOD 6.8181487e-05
4,123 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7927568e-05
4,511 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.5681258e-05
4,779 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.4163774e-05
4,817 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3985024e-05
4,915 Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs 2013 VLDB 6.356048e-05
5,377 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1562325e-05
5,477 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 6.1155396e-05
5,984 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.926237e-05
6,232 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.84313e-05
6,301 Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs 2020 SIGMOD 5.8188746e-05
6,504 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.7617085e-05
6,515 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.7590881e-05
6,617 CAVE: Concurrency-Aware Graph Processing on SSDs 2024 SIGMOD 5.7327861e-05
6,811 BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks 2018 SIGMOD 5.6744946e-05
7,478 Extending Graph Patterns with Conditions 2020 SIGMOD 5.5150923e-05
7,529 Fast Local Subgraph Counting 2024 VLDB 5.5009945e-05
8,042 Adaptive Optimizations of Recursive Queries in Teradata 2012 SIGMOD 5.4014499e-05
8,413 The shortest path is not always a straight line: Leveraging semi-metricity in graph analysis 2016 VLDB 5.3353234e-05
8,735 RBench: Application-Specific RDF Benchmarking 2015 SIGMOD 5.2905469e-05
9,097 Efficient Query Answering in Probabilistic RDF Graphs 2011 SIGMOD 5.2283159e-05
9,361 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1868213e-05
9,650 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.1453267e-05
9,715 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.1359137e-05
9,840 ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs 2020 VLDB 5.1230858e-05
10,062 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.0875952e-05
10,245 Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query 2020 SIGMOD 5.0525742e-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.00026700508
192 Algorithmics and Applications of Tree and Graph Searching 2002 PODS 0.00025659453
270 BLINKS: Ranked Keyword Searches on Graphs 2007 SIGMOD 0.00022599109
274 3-HOP: A High-Compression Indexing Scheme for Reachability Query 2009 SIGMOD 0.00022490994
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
293 Bidirectional Expansion For Keyword Search on Graph Databases 2005 VLDB 0.00021943678
330 Fast and Practical Indexing and Querying of Very Large Graphs 2007 SIGMOD 0.00020838159
332 FG-Index: Towards Verification-Free Query Processing on Graph Databases 2007 SIGMOD 0.00020765078
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018286607
736 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00014363536
774 Efficiently Answering Reachability Queries on Very Large Directed Graphs 2008 SIGMOD 0.00014083518
783 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00014021799
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 3,767 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB
2 774 Efficiently Answering Reachability Queries on Very Large Directed Graphs 2008 SIGMOD
3 3,934 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,413 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,336 Efficient Shortest Path Counting on Large Road Networks 2022 VLDB
8 4,139 Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs 2016 SIGMOD
9 5,803 Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement 2022 VLDB
10 5,896 Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks 2021 SIGMOD