25 search results - page 2 / 5 » Efficient k Nearest Neighbor Queries on Remote Spatial Datab... |
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
GIS
2005
ACM
14 years 6 months ago
2005
ACM
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
PVLDB
2008
13 years 4 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, ...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
SIGMOD
2009
ACM
14 years 5 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...