Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Reverse Nearest Neighbor Query

  • Dimitris Papadias
  • Yufei Tao
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_318

Synonyms

Reverse nearest neighbor search; RNN query

Definition

Given a multidimensional dataset P and a point q, a reverse nearest neighbor (RNN) query retrieves all the points pP that have q as their nearest neighbor. The set RNN(q) of reverse nearest neighbors of q is called the influence set of q. Formally, RNN(q) = {pP | ¬∃p′P such that dist(p,p′) < dist(p,q)}, where dist is a distance metric (Euclidean distance is assumed in the following examples).

The definition can also be extended to reverse k nearest neighbors (RkNN). Specifically, a RkNN query retrieves all the points pP that have q as one of their k nearest neighbors. In this case, RkNN(q) = {pP | dist(p,q) ≤ dist(p,pk), where pk is the k-th NN of p}.

Historical Background

Reverse nearest neighbor queries were proposed in [ 4] and have received considerable attention due to their importance in several applications involving decision support, resource allocation, profile-based marketing, etc. Fig.  1shows an example...
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Benetis R, Jensen C, Karciauskas G, Saltenis S. Nearest neighbor and reverse nearest neighbor queries for moving objects. VLDB J. 2006;15(3):229–50.CrossRefGoogle Scholar
  2. 2.
    Ferhatosmanoglu H, Stanoi I, Agrawal D, Abbadi A. Constrained nearest neighbor queries. In: Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases; 2001.CrossRefGoogle Scholar
  3. 3.
    Kang J, Mokbel M, Shekhar S, Xia T, Zhang D. Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In: Proceedings of the 23rd International Conference on Data Engineering; 2007. p. 806–15.Google Scholar
  4. 4.
    Korn F, Muthukrishnan S. Influence sets based on reverse nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2000. p. 201–12.CrossRefGoogle Scholar
  5. 5.
    Korn F, Muthukrishnan S, Srivastava D. Reverse nearest neighbor aggregates over data streams. In: Proceedings of the 28th International Conference on Very Large Data Bases; 2002. p. 814–25.CrossRefGoogle Scholar
  6. 6.
    Lin K, Nolen M, Yang C. Applying bulk insertion techniques for dynamic reverse nearest neighbor problems. In: Proceedings of the International Conference on Database Engineering and Applications; 2003. p. 290–7.Google Scholar
  7. 7.
    Maheshwari A, Vahrenhold J, Zeh N. On reverse nearest neighbor queries. In: Proceedings of the Canadian Conference Computational Geometry; 2002. p. 128–32.Google Scholar
  8. 8.
    Singh A, Ferhatosmanoglu H, Tosun A. High dimensional reverse nearest neighbor queries. In: Proceedings of the 12th International Conference on Information and Knowledge Management; 2003.Google Scholar
  9. 9.
    Stanoi I, Agrawal D, Abbadi A. Reverse nearest neighbor queries for dynamic databases. In: Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery; 2000. p. 44–53.Google Scholar
  10. 10.
    Stanoi I, Riedewald M, Agrawal D, Abbadi A. Discovery of influence sets in frequently updated databases. In: Proceedings of the 27th International Conference on Very Large Data Bases; 2001. p. 99–108.Google Scholar
  11. 11.
    Tao Y, Papadias D, Lian X. Reverse kNN search in arbitrary dimensionality. In: Proceedings of the 30th International Conference on Very Large Data Bases; 2004. p. 744–55.Google Scholar
  12. 12.
    Tao Y, Yiu M, Mamoulis N. Reverse nearest neighbor search in metric spaces. IEEE Trans Knowl Data Eng. 2006;18(9):1239–52.CrossRefGoogle Scholar
  13. 13.
    Yang C, Lin K. An index structure for efficient reverse nearest neighbor queries. In: Proceedings of the 17th International Conference on Data Engineering; 2001. p. 482–95.Google Scholar
  14. 14.
    Yiu M, Papadias D, Mamoulis N, Tao Y. Reverse nearest neighbors in large graphs. IEEE Trans Knowl Data Eng. 2006;18(4):540–53.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringHong Kong University of Science and TechnologyKowloonHong Kong
  2. 2.Chinese University of Hong KongHong KongChina

Section editors and affiliations

  • Dimitris Papadias
    • 1
  1. 1.Dept. of Computer Science and Eng.Hong Kong Univ. of Science and TechnologyKowloonHong Kong SAR