Efficiently processing snapshot and continuous reverse k nearest neighbors queries

Given a set of objects and a query q, a point p is called the reverse k nearest neighbor (RkNN) of q if q is one of the k closest objects of p. In this paper, we introduce the concept of influence zone that is the area such that every point inside this area is the RkNN of q and every point outside this area is not the RkNN. The influence zone has several applications in location-based services, marketing and decision support systems. It can also be used to efficiently process RkNN queries. First, we present efficient algorithm to compute the influence zone. Then, based on the influence zone, we present efficient algorithms to process RkNN queries that significantly outperform existing best-known techniques for both the snapshot and continuous RkNN queries. We also present a detailed theoretical analysis to analyze the area of the influence zone and IO costs of our RkNN processing algorithms. Our experiments demonstrate the accuracy of our theoretical analysis. This paper is an extended version of our previous work (Cheema et al. in Proceedings of ICDE, pp. 577–588, 2011). We make the following new contributions in this extended version: (1) we conduct a rigorous complexity analysis and show that the complexity of one of our proposed algorithms in Cheema et al. (Proceedings of ICDE, pp. 577–588, 2011) can be reduced from O(m2) to O( km) where m > k is the number of objects used to compute the influence zone, (2) we show that our techniques can be applied to dimensionality higher than two, and (3) we present efficient techniques to handle data updates.

[1]  Hans-Peter Kriegel,et al.  Reverse k-Nearest Neighbor monitoring on mobile objects , 2010, GIS '10.

[2]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[3]  Jian Pei,et al.  Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data , 2010, IEEE Transactions on Knowledge and Data Engineering.

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

[5]  Walid G. Aref,et al.  SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases , 2005, 21st International Conference on Data Engineering (ICDE'05).

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

[7]  Divyakant Agrawal,et al.  Discovery of Influence Sets in Frequently Updated Databases , 2001, VLDB.

[8]  Rolf Klein,et al.  Searching for the kernel of a polygon—a competitive strategy , 1995, SCG '95.

[9]  Muhammad Aamir Cheema,et al.  A Unified Algorithm for Continuous Monitoring of Spatial Queries , 2011, DASFAA.

[10]  David Taniar,et al.  Reverse k Nearest Neighbor and Reverse Farthest Neighbor Search on Spatial Networks , 2009, Trans. Large Scale Data Knowl. Centered Syst..

[11]  Hans-Peter Kriegel,et al.  A novel probabilistic pruning approach to speed up similarity queries in uncertain databases , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[12]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

[13]  Timos K. Sellis,et al.  Efficient Cost Models for Spatial Queries Using R-Trees , 2000, IEEE Trans. Knowl. Data Eng..

[14]  Xiang Lian,et al.  Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data , 2009, The VLDB Journal.

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

[16]  Thomas Brinkhoff,et al.  A Framework for Generating Network-Based Moving Objects , 2002, GeoInformatica.

[17]  David Taniar,et al.  Voronoi-based reverse nearest neighbor query processing on spatial networks , 2009, Multimedia Systems.

[18]  Elke Achtert,et al.  Reverse k-nearest neighbor search in dynamic and general metric databases , 2009, EDBT '09.

[19]  Sharad Mehrotra,et al.  Dynamic Queries over Mobile Objects , 2002, EDBT.

[20]  Muhammad Aamir Cheema,et al.  Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN , 2009, Proc. VLDB Endow..

[21]  Muhammad Aamir Cheema,et al.  Multi-guarded safe zone: An effective technique to monitor moving circular range queries , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[22]  Hans-Peter Kriegel,et al.  Boosting spatial pruning: on optimal pruning of MBRs , 2010, SIGMOD Conference.

[23]  Ling Liu,et al.  MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System , 2004, EDBT.

[24]  Muhammad Aamir Cheema,et al.  Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks , 2011, The VLDB Journal.

[25]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[26]  Muhammad Aamir Cheema,et al.  Continuous Monitoring of Distance-Based Range Queries , 2011, IEEE Transactions on Knowledge and Data Engineering.

[27]  Kyriakos Mouratidis,et al.  Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring , 2005, SIGMOD '05.

[28]  King-Ip Lin,et al.  Applying bulk insertion techniques for dynamic reverse nearest neighbor problems , 2003, Seventh International Database Engineering and Applications Symposium, 2003. Proceedings..

[29]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[30]  Muhammad Aamir Cheema,et al.  Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries , 2010, DASFAA.

[31]  Yufei Tao,et al.  Location-based spatial queries , 2003, SIGMOD '03.

[32]  Wei Wu,et al.  FINCH: evaluating reverse k-Nearest-Neighbor queries on location data , 2008, Proc. VLDB Endow..

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

[34]  Xuemin Lin,et al.  Efficient construction of safe regions for moving kNN queries over dynamic datasets , 2009 .

[35]  Man Lung Yiu,et al.  Common Influence Join: A Natural Join Operation for Spatial Pointsets , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[36]  Hans-Peter Kriegel,et al.  Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data , 2011, Proc. VLDB Endow..

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

[38]  Yufei Tao,et al.  Continuous Nearest Neighbor Search , 2002, VLDB.

[39]  Muhammad Aamir Cheema,et al.  Influence zone: Efficiently processing reverse k nearest neighbors queries , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[40]  Hanan Samet,et al.  Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates , 2003, VLDB.

[41]  Tian Xia,et al.  Continuous Reverse Nearest Neighbor Monitoring , 2006, 22nd International Conference on Data Engineering (ICDE'06).

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

[43]  Philip S. Yu,et al.  Early prediction on time series: a nearest neighbor approach , 2009, IJCAI 2009.

[44]  Xiaohui Yu,et al.  Monitoring k-nearest neighbor queries over moving objects , 2005, 21st International Conference on Data Engineering (ICDE'05).

[45]  Chao Jiang,et al.  Continuous Reverse Nearest Neighbor Queries on Moving Objects in Road Networks , 2008, 2008 The Ninth International Conference on Web-Age Information Management.

[46]  Jianjun Li,et al.  Continuous reverse k nearest neighbor monitoring on moving objects in road networks , 2010, Inf. Syst..

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

[48]  Wei Wu,et al.  Continuous Reverse k-Nearest-Neighbor Monitoring , 2008, The Ninth International Conference on Mobile Data Management (mdm 2008).