An Adjustable-Tree Method for Processing Reverse Nearest Neighbor Moving Queries

  • Ye-In Chang
  • Jun-Hong ShenEmail author
  • Che-Min Chu
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 551)


For a reverse nearest neighbor (RNN) query, the query object will find the data objects regard it as their nearest neighbor. Over the past few years, the RNN query on the road network database has attracted much attention. In the previous research, a multi-way tree efficiently solves the issue about moving data objects for the RNN query. However, in the scenario that the query object reaches a new location, i.e., the moving query, the multi-way tree needs to be reconstructed, which takes long time. Therefore, in this paper, we propose an adjustable-tree method for solving the above problem and improving the performance efficiency for processing moving queries. Via the performance evaluation, our proposed method performs better than the original multi-way tree method.


Reverse nearest neighbor queries Road network Spatial database 



This research was supported by grant MOST 104-2221-E-110-077 from the Ministry of Science and Technology, Taiwan.


  1. 1.
    Chiu, C.M.: An incremental approach to reverse nearest neighbor queries on the moving query in road networks. Master’s thesis. National Sun Yat-Sen University, Taiwan (2014)Google Scholar
  2. 2.
    Guohui, L., Yanhong, L., Jianjun, L., Shu, L., Fumin, Y.: Continuous reverse k nearest neighbor monitoring on moving objects in road networks. Inf. Syst. 35(8), 860–883 (2010)CrossRefGoogle Scholar
  3. 3.
    Hoel, E.G., Samet, H.: Efficient processing of spatial queries in line segment databases. In: Proceedings of the Second International Symposium on Advances in Spatial Databases, pp. 237–256 (1991)Google Scholar
  4. 4.
    Kang, J.M., Mokbel, M.F., Shekhar, S., Xia, T., Zhang, D.: Incremental and general evaluation of reverse nearest neighbors. IEEE Trans. Knowl. Data Eng. 22(7), 983–999 (2010)CrossRefGoogle Scholar
  5. 5.
    Li, J., Li, Y., Shen, P., Xia, X., Zong, C., Xia, C.: Reverse k nearest neighbor queries in time-dependent road networks. In: Proceedings of IEEE 20th International Conference on High Performance Computing and Communications, pp. 1064–1069 (2018)Google Scholar
  6. 6.
    Safar, M., Ibrahimi, D., Taniar, D.: Voronoi-based reverse nearest neighbor query processing on spatial networks. Multimedia Syst. 15(5), 295–308 (2009)CrossRefGoogle Scholar
  7. 7.
    Sun, H.L., Jiang, C., Liu, J.L., Sun, L.: Continuous reverse nearest neighbor queries on moving objects in road networks. In: Proceedings of the 9th International Conference on Web-Age Information Management, pp. 238–245 (2008)Google Scholar
  8. 8.
    Taniar, D., Safar, M., Tran, Q.T., Rahayu, W., Park, J.H.: Spatial network RNN queries in GIS. Comput. J. 54(4), 617–627 (2011)CrossRefGoogle Scholar
  9. 9.
    Tao, Y., Yiu, M.L., Mamoulis, N.: Reverse nearest neighbor search in metric spaces. IEEE Trans. Knowl. Data Eng. 18(9), 1239–1252 (2006)CrossRefGoogle Scholar
  10. 10.
    Tran, Q.T., Taniar, D., Safar, M.: Bichromatic reverse nearest-neighbor search in mobile systems. Syst. J. 4(2), 230–242 (2010)Google Scholar
  11. 11.
    Wu, W., Yang, F., Chan, C.Y., Tan, K.L.: Continuous reverse k-nearest-neighbor monitoring. In: Proceedings of the 9th International Conference on Mobile Data Management, pp. 132–139 (2008)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringNational Sun Yat-Sen UniversityKaohsiung CityTaiwan
  2. 2.Department of Information CommunicationAsia UniversityTaichung CityTaiwan
  3. 3.Department of Medical ResearchChina Medical University Hospital, China Medical UniversityTaichung CityTaiwan

Personalised recommendations