860 search results - page 9 / 172 » An Efficient Technique for Distance Computation in Road Netw... |
GIS
2008
ACM
13 years 8 months ago
2008
ACM
Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanni...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
PVLDB
2010
13 years 5 months ago
2010
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...
PVLDB
2008
13 years 6 months ago
2008
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...