Efficient algorithms for reverse proximity query problems

Determining the influence of an object on other objects in a database, based on proximity, is important in many applications. Abstractly, we wish to pre-process a set, P, of points in d-space so that the points of P that are assigned a new query point q as a Euclidean nearest neighbor can be reported quickly. These are the reverse nearest neighbors of q and are the ones most influenced by q. This generalizes to bichromatic reverse nearest neighbors, in which two sets, clients and servers, are given, where each client is influenced by some server, and of interest are the clients that are assigned a new server q as a nearest neighbor. Both extend to higher orders k > 1, where we seek the points that are assigned q as one of their k nearest neighbors, indicating varying degrees of influence. Each version also has a counterpart where "nearest" is replaced by "farthest", signifying low influence. We present a general approach that solves such reverse proximity query problems in an efficient and unified way, in any dimension, using well-known geometric transformations. We also give simple approximation algorithms in two and three dimensions (the primary domain of GIS applications) that report points that are "close to" being the desired true reverse proximity neighbors, as determined by a user-specified error parameter. This is based on approximating the proximity loci of the points by suitable convex polytopes that are amenable to simple and efficient querying. Theoretical analyses show that our solutions are fast and provably accurate, and this is further confirmed by experiments.

[1]  Yufei Tao,et al.  Reverse Nearest Neighbor Search in Metric Spaces , 2006, IEEE Transactions on Knowledge and Data Engineering.

[2]  Richard J. Anderson,et al.  The inverse nearest neighbor problem with astrophysical applications , 2001, SODA '01.

[3]  Divyakant Agrawal,et al.  Reverse Nearest Neighbor Queries for Dynamic Databases , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.

[4]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[5]  King-Ip Lin,et al.  An index structure for efficient reverse nearest neighbor queries , 2001, Proceedings 17th International Conference on Data Engineering.

[6]  Shashi Shekhar,et al.  Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[7]  Jan Vahrenhold,et al.  Reverse Nearest Neighbor Queries , 2002, Encyclopedia of GIS.

[8]  Pankaj K. Agarwal,et al.  Geometric Range Searching and Its Relatives , 2007 .

[9]  Elke Achtert,et al.  Efficient reverse k-nearest neighbor search in arbitrary metric spaces , 2006, SIGMOD Conference.

[10]  Christian S. Jensen,et al.  Nearest neighbor and reverse nearest neighbor queries for moving objects , 2002, Proceedings International Database Engineering and Applications Symposium.

[11]  Yannis Manolopoulos,et al.  C2P: Clustering based on Closest Pairs , 2001, VLDB.

[12]  Amit Singh,et al.  High dimensional reverse nearest neighbor queries , 2003, CIKM '03.

[13]  Divesh Srivastava,et al.  Reverse Nearest Neighbor Aggregates Over Data Streams , 2002, VLDB.

[14]  S. Muthukrishnan,et al.  Influence sets based on reverse nearest neighbor queries , 2000, SIGMOD '00.

[15]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[16]  Yufei Tao,et al.  Reverse nearest neighbors in large graphs , 2005, 21st International Conference on Data Engineering (ICDE'05).

[17]  Alok Aggarwal,et al.  Solving query-retrieval problems by compacting Voronoi diagrams , 1990, STOC '90.

[18]  Christian S. Jensen,et al.  Nearest and reverse nearest neighbor queries for moving objects , 2006, The VLDB Journal.

[19]  Yufei Tao,et al.  Reverse kNN Search in Arbitrary Dimensionality , 2004, VLDB.