Database Paper Browser

Back to papers

Effective Caching of Shortest Paths for Location-Based Services

Summary: Introduces caching for shortest-path queries in location services; shows web caching fails due to query matching and cost. Exploits optimal subpath property, log-based benefit estimation, and greedy placement with a compact match cache. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4533
Venue
SIGMOD
Year
2012
Pagerank
6.4427171e-05
Overall Rank
4,111 | 71.41%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

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

Rank Cited Paper Year Venue Pagerank
11 Implementing Data Cubes Efficiently 1996 SIGMOD 0.0011708144
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
442 Semantic Data Caching and Replacement 1996 VLDB 0.000230437
2,535 Distance Indexing on Road Networks 2006 VLDB 8.5864426e-05
Previous Page 1 / 1 Next

Semantically Similar Papers