DocumentCode :
3134103
Title :
Continuous K-nearest neighbor search for moving objects
Author :
Li, Yifan ; Yang, Jiong ; Han, Jiawei
Author_Institution :
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
fYear :
2004
fDate :
21-23 June 2004
Firstpage :
123
Lastpage :
126
Abstract :
The paper describes a new method of continuously monitoring the k nearest neighbors of a given object in the mobile environment. Instead of monitoring all k nearest neighbors, we choose to monitor the k-th (nearest) neighbor since the necessary condition of changes in the KNN is the change of the k-th neighbor. In addition, rather than in the original space, we consider the moving objects in a transformed time-distance (TD) space, where each object is represented by a curve. A beach-line algorithm is developed to monitor the change of the k-th neighbor, which enables us to maintain the KNN incrementally. An extensive empirical study shows that the beach-line algorithm outperforms the most efficient existing algorithm by a wide margin, especially when k or n (the total number of objects) is large.
Keywords :
pattern recognition; query processing; search problems; K-nearest neighbor search; beach-line algorithm; continuous neighbor search; curve representation; k-th nearest neighbor; mobile environment; moving objects; time-distance space; Computer science; Computerized monitoring; Condition monitoring; Databases; Degradation; Delay effects; Indexing; Mobile computing; Nearest neighbor searches; Proposals;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Scientific and Statistical Database Management, 2004. Proceedings. 16th International Conference on
ISSN :
1099-3371
Print_ISBN :
0-7695-2146-0
Type :
conf
DOI :
10.1109/SSDM.2004.1311202
Filename :
1311202
Link To Document :
بازگشت