DocumentCode :
3613926
Title :
Nearest neighbor and reverse nearest neighbor queries for moving objects
Author :
R. Benetis;C.S. Jensen;G. Karciauskas;S. Saltenis
Author_Institution :
Dept. of Comput. Sci., Aalborg Univ., Denmark
fYear :
2002
fDate :
6/24/1905 12:00:00 AM
Firstpage :
44
Lastpage :
53
Abstract :
With the proliferation of wireless communications and the rapid advances in technologies for tracking the positions of continuously moving objects, algorithms for efficiently answering queries about large numbers of moving objects increasingly are needed. One such query is the reverse nearest neighbor (RNN) query that returns the objects that have a query object as their closest object. While algorithms have been proposed that compute RNN queries for non-moving objects, there have been no proposals for answering RNN queries for continuously moving objects. Another such query is the nearest neighbor (NN) query, which has been studied extensively and in many contexts. Like the RNN query, the NN query has not been explored for moving query and data points. This paper proposes an algorithm for answering RNN queries for continuously moving points in the plane. As a part of the solution to this problem and as a separate contribution, an algorithm for answering NN queries for continuously moving points is also proposed. The results of performance experiments are reported.
Keywords :
"Nearest neighbor searches","Recurrent neural networks","Databases","Neural networks","Internet","Computer science","Wireless communication","Proposals","Home appliances","Computer industry"
Publisher :
ieee
Conference_Titel :
Database Engineering and Applications Symposium, 2002. Proceedings. International
ISSN :
1098-8068
Print_ISBN :
0-7695-1638-6
Type :
conf
DOI :
10.1109/IDEAS.2002.1029655
Filename :
1029655
Link To Document :
بازگشت