Answering Range-Based Reverse kNN Queries

  • Zhefan Zhong
  • Xin LinEmail author
  • Liang He
  • Yan Yang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10988)


Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Despite significant progress on this problem, there is a research gap in finding RkNNs not just for an object, but for a given range, which is a natural extension of the problem. Motivated by this, we develop algorithms for exact processing of range-based RkNN with arbitrary values of k on dynamic datasets, which retrieve all the data points that have any position in the given query range R as one of their k nearest neighbors. The experimental results demonstrate the efficiency and the accuracy of our proposed optimizations and algorithms.


Range-based RkNN queries Location-based services 


  1. 1.
    Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322–331 (1990)CrossRefGoogle Scholar
  2. 2.
    Tao, Y., Papadias, D., Lian, X.: Reverse kNN search in arbitrary dimensionality. In: VLDB, pp. 744–755 (2004)Google Scholar
  3. 3.
    Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, vol. 29, no. 2, pp. 201–212 (2000)CrossRefGoogle Scholar
  4. 4.
    Korn, F., Muthukrishnan, S., Srivastava, D.: Reverse nearest neighbor aggregates over data streams. In: VLDB, pp. 814–825 (2002)CrossRefGoogle Scholar
  5. 5.
    Benetis, R., Jensen, C., Karciauskas, G., Saltenis, S.: Nearest neighbor and reverse nearest neighbor queries for moving objects. In: IDEAS, vol. 15, no. 3, pp. 44–53 (2002)Google Scholar
  6. 6.
    Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.: Discovery of influence sets in frequently updated databases. In: VLDB, pp. 99–108 (2001)Google Scholar
  7. 7.
    Yang, C., Lin, K.: An index structure for efficient reverse nearest neighbor queries. In: ICDE, pp. 485–492 (2001)Google Scholar
  8. 8.
    Chen, L., Lin, X., Hu, H., Jensen, C.S., Xu, J.: Answering why-not questions on spatial keyword top-k queries. In: ICDE, pp. 279–290 (2015)Google Scholar
  9. 9.
    Chen, L., Xu, J., Lin, X., Jensen, C.S., Hu, H.: Answering why-not spatial keyword top-k queries via keyword adaption. In: ICDE, pp. 697–708 (2016)Google Scholar
  10. 10.
    Stanoi, I., Agrawal, D., Abbadi, A.: Reverse nearest neighbor queries for dynamic databases. In: SIGMOD Workshop, vol. 29, no. 5, pp. 44–53 (2000)Google Scholar
  11. 11.
    Singh, A., Ferhatosmanoglu, H., Tosun, A.: High dimensional reverse nearest neighbor queries. In: CIKM, pp. 91–98 (2003)Google Scholar
  12. 12.
    Li, H., Hu, H., Xu, J.: Nearby friend alert: location anonymity in mobile geosocial networks. IEEE Pervasive Comput. 12(4), 62–70 (2013)CrossRefGoogle Scholar
  13. 13.
    Maheshwari, A., Vahrenhold, J., Zeh, N.: On reverse nearest neighbor queries. In: CCCG, vol. 17, no. 1, pp. 63–95 (2002)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Shanghai Key Laboratory of Multidimensional Information ProcessingShanghaiChina
  2. 2.Department of Computer Science and TechnologyEast China Normal UniversityShanghaiChina

Personalised recommendations