Sciweavers

43 search results - page 2 / 9
» Monitoring K-Nearest Neighbor Queries Over Moving Objects
Sort
View
DEXA
2007
Springer
173views Database» more  DEXA 2007»
13 years 11 months ago
A P2P Technique for Continuous k-Nearest-Neighbor Query in Road Networks
Due to the high frequency in location updates and the expensive cost of continuous query processing, server computation capacity and wireless communication bandwidth are the two li...
Fuyu Liu, Kien A. Hua, Tai T. Do
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
13 years 9 months ago
Optimal Multi-Step k-Nearest Neighbor Search
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...
Thomas Seidl, Hans-Peter Kriegel
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
14 years 4 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...
VLDB
2009
ACM
381views Database» more  VLDB 2009»
14 years 4 months ago
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive...
Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei...
ICDE
2005
IEEE
172views Database» more  ICDE 2005»
13 years 10 months ago
Monitoring K-Nearest Neighbor Queries Over Moving Objects
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem...
Xiaohui Yu, Ken Q. Pu, Nick Koudas