Sciweavers

44 search results - page 6 / 9
» Anonymous Query Processing in Road Networks
Sort
View
ICDE
2006
IEEE
126views Database» more  ICDE 2006»
14 years 8 months ago
Enabling Query Processing on Spatial Networks
A system that enables real time query processing on large spatial networks is demonstrated. The system provides functionality for processing a wide range of spatial queries such a...
Jagan Sankaranarayanan, Houman Alborzi, Hanan Same...
PVLDB
2010
269views more  PVLDB 2010»
13 years 5 months ago
Shortest Path Computation on Air Indexes
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...
Georgios Kellaris, Kyriakos Mouratidis
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
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
13 years 11 months 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...
ICDE
2009
IEEE
149views Database» more  ICDE 2009»
14 years 8 months ago
OPAQUE: Protecting Path Privacy in Directions Search
Directions search returns the shortest path from a source to a destination on a road network. However, the search interests of users may be exposed to the service providers, thus r...
Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Baih...