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
10090
Venue
VLDB
Year
2010
Pagerank
0.00020516762
Overall Rank
352 | 97.56%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 53 citing papers.

Rank Citing Paper Year Venue Pagerank
10,740 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1725247e-05
10,951 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.1725247e-05
11,574 Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query 2020 SIGMOD 5.1725247e-05
Previous Page 2 / 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