Efficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks
1
Department of Computer Engineering, Ajou University, Suwon 16499, Korea
2
Department of Software, Kyungpook National University, Sangju-si 37224, Korea
*
Author to whom correspondence should be addressed.
Academic Editors: Norbert Bartelme and Wolfgang Kainz
ISPRS Int. J. Geo-Inf. 2016, 5(12), 247; https://doi.org/10.3390/ijgi5120247
Received: 8 August 2016
/
Revised: 11 November 2016
/
Accepted: 23 November 2016
/
Published: 20 December 2016
A reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k closest points. In recent years, considerable research has been conducted into monitoring reverse k nearest neighbor queries. In this paper, we study the problem of continuous reverse nearest neighbor queries where both the query object q and data objects are moving. Existing state-of-the-art techniques are sensitive towards the movement of data objects, e.g., a candidate object must be verified whenever it changes its location. Further, insufficient attention has been given to the monitoring of RNN queries in dynamic road networks where the network weight changes depending on the traffic conditions. In this paper, we address these problems by proposing a new safe exit-based algorithm called CORE-X for efficiently computing the safe exit points of both query and data objects. The safe exit point of an object indicates the point at which its safe region and non-safe region meet, thus a set of safe exit points represents the border of the safe region. Within the safe region, the query result remains unchanged provided the query and data objects remain inside their respective safe regions. The results of extensive experiments conducted using real road maps indicate that the proposed algorithm significantly reduces communication and computation costs compared to the state-of-the-art algorithm.
View Full-Text
Keywords:
continuous monitoring; location-based applications; reverse nearest neighbor query; safe exit algorithm; mobile computing; road network
▼
Show Figures
Figure 1
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
MDPI and ACS Style
Attique, M.; Cho, H.-J.; Jin, R.; Chung, T.-S. Efficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks. ISPRS Int. J. Geo-Inf. 2016, 5, 247. https://doi.org/10.3390/ijgi5120247
AMA Style
Attique M, Cho H-J, Jin R, Chung T-S. Efficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks. ISPRS International Journal of Geo-Information. 2016; 5(12):247. https://doi.org/10.3390/ijgi5120247
Chicago/Turabian StyleAttique, Muhammad, Hyung-Ju Cho, Rize Jin, and Tae-Sun Chung. 2016. "Efficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks" ISPRS International Journal of Geo-Information 5, no. 12: 247. https://doi.org/10.3390/ijgi5120247
Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
