{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T14:39:03Z","timestamp":1760452743838,"version":"build-2065373602"},"reference-count":31,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2016,12,20]],"date-time":"2016-12-20T00:00:00Z","timestamp":1482192000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/ijgi5120247","type":"journal-article","created":{"date-parts":[[2016,12,23]],"date-time":"2016-12-23T04:09:09Z","timestamp":1482466149000},"page":"247","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks"],"prefix":"10.3390","volume":"5","author":[{"given":"Muhammad","family":"Attique","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Ajou University, Suwon 16499, Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7458-8888","authenticated-orcid":false,"given":"Hyung-Ju","family":"Cho","sequence":"additional","affiliation":[{"name":"Department of Software, Kyungpook National University, Sangju-si 37224, Korea"}]},{"given":"Rize","family":"Jin","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Ajou University, Suwon 16499, Korea"}]},{"given":"Tae-Sun","family":"Chung","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Ajou University, Suwon 16499, Korea"}]}],"member":"1968","published-online":{"date-parts":[[2016,12,20]]},"reference":[{"key":"ref_1","unstructured":"Ciuonzo, D., Buonanno, A., D\u2019Urso, M., and Palmieri, F. (2011, January 5\u20138). Distributed classification of multiple moving targets with binary wireless sensor network. Proceedings of the 14th International Conference on Information Fusion (FUSION), Chicago, IL, USA."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Buonanno, A., D\u2019Urso, M., Prisco, G., Felaco, M., Meliad\u00f2, E.F., Mattei, M., Palmieri, F., and Ciuonzo, D. (2012, January 12\u201314). Mobile sensor networks based on autonomous platforms for homeland security. Proceedings of the Tyrrhenian Workshop on Advances in Radar and Remote Sensing (TyWRRS), Naples, Italy.","DOI":"10.1109\/TyWRRS.2012.6381108"},{"key":"ref_3","first-page":"37","article-title":"A safe exit algorithm for continuous nearest neighbor monitoring in road networks","volume":"9","author":"Cho","year":"2013","journal-title":"Mob. Inf. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.is.2013.10.008","article-title":"An efficient algorithm for computing safe exit points of moving range queries in directed road networks","volume":"41","author":"Cho","year":"2014","journal-title":"Inf. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1109\/TKDE.2010.171","article-title":"Processing of continuous location-based range queries on moving objects in road networks","volume":"23","author":"Wang","year":"2011","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.datak.2011.10.001","article-title":"A safe-exit approach for efficient network-based moving range queries","volume":"72","author":"Yung","year":"2012","journal-title":"Data Knowl. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Zhang, J., Zhu, M., Papadias, D., Tao, Y., and Lee, D. (2003, January 10\u201312). Location-based spatial queries. Proceedings of the 2003 ACM SIGMOD International Conference on Management of data, San Diego, CA, USA.","DOI":"10.1145\/872757.872812"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00778-011-0235-9","article-title":"Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks","volume":"21","author":"Cheema","year":"2012","journal-title":"VLDB J."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Korn, F., and Muthukrishnan, S. (2000, January 16\u201318). Influence sets based on reverse nearest neighbor queries. Proceedings of the 2000 ACM SIGMOD international conference on Management of data, Dallas, TX, USA.","DOI":"10.1145\/342009.335415"},{"key":"ref_10","unstructured":"Stanoi, I., Agrawal, S., and Abbadi, A. (2000, January 14). Reverse nearest neighbor queries for dynamic databases. Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, TX, USA."},{"key":"ref_11","unstructured":"Tao, Y., Papadias, D., and Lian, X. (September, January 31). Reverse kNN search in arbitrary dimensionality. Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Japan."},{"key":"ref_12","unstructured":"Kolahdouzan, M., and Shahabi, C. ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Japan, 31 August\u20133 September 2004, ACM."},{"key":"ref_13","unstructured":"Gao, Y., Zheng, B., Chen, G., Lee, W., Lee, K., and Li, Q. (April, January 29). Visible reverse k-nearest neighbor queries. Proceedings of the IEEE 25th International Conference on Data Engineering, Shanghai, China."},{"key":"ref_14","unstructured":"Li, G., Fan, P., Li, Y., and Du, J. (July, January 29). An efficient technique for continuous k-nearest neighbor query processing on moving objects in a road network. Proceedings of the IEEE 10th International Conference on Computer and Information Technology (CIT), Bradford, UK."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Song, Z., and Roussopoulos, N. (2001, January 12\u201315). K-nearest neighbor search for moving query point. Proceedings of the International Symposium on Spatial and Temporal Databases (SSTD), Redondo Beach, CA, USA.","DOI":"10.1007\/3-540-47724-1_5"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Sun, H., Jiang, C., Liu, J., and Sun, L. (2008, January 20\u201322). Continuous reverse nearest neighbor queries on moving objects in road networks. Proceedings of the Ninth International Conference on Web-Age Information Management (WAIM), Zhangjiajie, Hunan, China.","DOI":"10.1109\/WAIM.2008.64"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1109\/TKDE.2006.1599391","article-title":"Reverse nearest neighbor in large graphs","volume":"18","author":"Yiu","year":"2006","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_18","unstructured":"Benetis, R., Jensen, C., Karciauskas, G., and Saltenis, S. (2002, January 17\u201319). Nearest neighbor and reverse nearest neighbor queries for moving objects. Proceedings of the International Database Engineering and Applications Symposium, Edmonton, AB, Canada."},{"key":"ref_19","unstructured":"Xia, T., and Zhang, D. (2006, January 3\u20137). Continuous reverse nearest neighbor monitoring. Proceedings of the 22nd International Conference on Data Engineering (ICDE), Atlanta, GA, USA."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Kang, J., Mokbel, M., Shekhar, S., Xia, T., and Zhang, D. (2007, January 16\u201320). Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. Proceedings of IEEE 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey.","DOI":"10.1109\/ICDE.2007.367926"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Wu, W., Yang, F., Chan, C., and Tan, K. (2008, January 27\u201330). Continuous reverse k-nearest-neighbor monitoring. Proceedings of the Ninth International Conference on Mobile Data Management (MDM), Beijing, China.","DOI":"10.1109\/MDM.2008.31"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Cheema, M., Lin, X., Zhang, W., and Zhang, Y. (2011, January 11\u201316). Influence zone: Efficiently processing reverse k nearest neighbors queries. Proceedings of the IEEE 27th International Conference on Data Engineering (ICDE), Hannover, Germany.","DOI":"10.1109\/ICDE.2011.5767904"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s00530-009-0167-z","article-title":"Voronoi-based reverse nearest neighbor query processing on spatial networks","volume":"15","author":"Safar","year":"2009","journal-title":"Multimed. Syst."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1016\/j.is.2010.05.002","article-title":"Continuous reverse k nearest neighbor monitoring on moving objects in road networks","volume":"35","author":"Li","year":"2010","journal-title":"Inf. Syst."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Gotoh, Y. (2014, January 10\u201312). A simple routing method for reverse k-nearest neighbor queries in spatial networks. Proceedings of the IEEE 17th International Conference on Network-Based Information Systems, Salerno, Italy.","DOI":"10.1109\/NBiS.2014.55"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1093\/comjnl\/bxt115","article-title":"Efficiently monitoring reverse k-nearest neighbors in spatial networks","volume":"58","author":"Wang","year":"2015","journal-title":"Comput. J."},{"key":"ref_27","first-page":"540","article-title":"A safe exit approach for continuous monitoring of reverse k nearest neighbors in road networks","volume":"12","author":"Attique","year":"2015","journal-title":"Int. Arab J. Inf. Tech."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-319-23467-0_8","article-title":"CORE: Continuous monitoring of reverse k nearest neighbors on moving objects in road networks","volume":"2015","author":"Attique","year":"2016","journal-title":"Stud. Comput. Intell."},{"key":"ref_29","unstructured":"Cormen, T., Leiserson, C., Rivest, R., and Stein, C. (2009). Introduction to Algorithms, MIT Press and McGraw-Hill. [3rd ed.]."},{"key":"ref_30","unstructured":"Real Datasets for Spatial Databases. Available online: https:\/\/www.cs.utah.edu\/~lifeifei\/SpatialDataset.htm."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1015231126594","article-title":"A framework for generating network-based moving objects","volume":"6","author":"Brinkhoff","year":"2002","journal-title":"GeoInformatica"}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/5\/12\/247\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:28:55Z","timestamp":1760210935000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/5\/12\/247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,20]]},"references-count":31,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2016,12]]}},"alternative-id":["ijgi5120247"],"URL":"https:\/\/doi.org\/10.3390\/ijgi5120247","relation":{},"ISSN":["2220-9964"],"issn-type":[{"type":"electronic","value":"2220-9964"}],"subject":[],"published":{"date-parts":[[2016,12,20]]}}}