Database Paper Browser

Back to papers

On k-skip Shortest Paths

Summary: Introduces k-skip shortest paths: P* hits every k-th vertex along the SP, yielding a 1/k sampled description. SNDB algorithms compute k-skip SPs faster than full SPs with a compact index smaller than the road network, validated on real data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4401
Venue
SIGMOD
Year
2011
Pagerank
0.00014422699
Overall Rank
1,054 | 92.67%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
376 TEDI: Efficient Shortest Path Query Answering on Graphs 2010 SIGMOD 0.00025097452
433 Scalable Network Distance Browsing in Spatial Databases 2008 SIGMOD 0.00023310419
945 Path Oracles for Spatial Networks 2009 VLDB 0.00015137526
1,230 Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions 2011 VLDB 0.00013150837
Previous Page 1 / 1 Next

Semantically Similar Papers