ESA: An Efficient and Stable Approach to Querying Reverse k-Nearest-Neighbor of Moving Objects

In this work, we study how to improve the efficiency and stability of querying reverse k-nearest-neighbor (RkNN) for moving objects. An approach named as ESA is presented in this paper. Different from the existing approaches, ESA selects k objects as pruning reference objects for each time of pruning. In this way, its greatly improves the query efficiency. ESA also reduces the communication cost and enhances the stability of the server by adaptively adjusting the objects' safe regions. Experimental results verify the performance of our proposed approach.

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

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

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

[4]  Flip Korn,et al.  Influence sets based on reverse nearest neighbor queries , 2000, SIGMOD 2000.

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

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

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