38 search results - page 3 / 8 » V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor... |
SIGMOD
1998
ACM
13 years 11 months ago
1998
ACM
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
GIS
2010
ACM
13 years 5 months ago
2010
ACM
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
ICDE
2011
IEEE
12 years 10 months ago
2011
IEEE
— A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often...
GIS
2005
ACM
14 years 8 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...