123 search results - page 12 / 25 » Query Processing Using Distance Oracles for Spatial Networks |
193
Voted
GIS
2007
ACM
16 years 21 days ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
177
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
GIS
2009
ACM
15 years 4 months ago
2009
ACM
The in-network query processing paradigm in sensor networks postulates that a query is routed among sensors and collects the answers from the sensors on its trajectory. It works f...
GIS
2002
ACM
14 years 11 months ago
2002
ACM
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
182
Voted
GIS
2004
ACM
16 years 20 days ago
2004
ACM
Despite various interoperability recommendations, heterogeneity of Geographic Information Systems (GIS) is still an issue. This led to an increasing need for a data integration sy...