Sciweavers

17 search results - page 3 / 4
» In Transit to Constant Time Shortest-Path Queries in Road Ne...
Sort
View
EDBT
2012
ACM
255views Database» more  EDBT 2012»
11 years 10 months ago
Top-k spatial keyword queries on road networks
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
João B. Rocha-Junior, Kjetil Nørv&ar...
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
14 years 18 days ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
12 years 11 months ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 9 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
TKDE
2010
195views more  TKDE 2010»
13 years 5 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet