Continuous visible k nearest neighbor query on moving objects

A visible k nearest neighbor (Vk NN) query retrieves k objects that are visible and nearest to the query object, where “visible” means that there is no obstacle between an object and the query object. Existing studies on the Vk NN query have focused on static data objects. In this paper we investigate how to process the query on moving objects continuously. We propose an effective filtering-and-refinement framework for evaluating this type of queries. We exploit spatial proximity and visibility properties between the query object and data objects to prune search space under this framework. A detailed cost analysis and a comprehensive experimental study are conducted on the proposed framework. The results validate the effectiveness of the pruning techniques and verify the efficiency of the proposed framework. The proposed framework outperforms a straightforward solution by an order of magnitude in terms of both communication and computation costs.

[1]  David Taniar,et al.  Indexing moving objects for directions and velocities queries , 2013, Inf. Syst. Frontiers.

[2]  Roger Zimmermann,et al.  Partition-based lazy updates for continuous queries over moving objects , 2007, GIS.

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

[4]  Walid G. Aref,et al.  SINA: scalable incremental processing of continuous queries in spatio-temporal databases , 2004, SIGMOD '04.

[5]  Simonas Saltenis,et al.  Trees or grids?: indexing moving objects in main memory , 2009, GIS.

[6]  Yunjun Gao,et al.  Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases , 2009, IEEE Transactions on Knowledge and Data Engineering.

[7]  Yunjun Gao,et al.  Continuous visible nearest neighbor queries , 2009, EDBT '09.

[8]  Christian S. Jensen,et al.  Indexing the positions of continuously moving objects , 2000, SIGMOD '00.

[9]  Raymond Chi-Wing Wong,et al.  A highly optimized algorithm for continuous intersection join queries over moving objects , 2011, The VLDB Journal.

[10]  Rui Zhang,et al.  Incremental Evaluation of Visible Nearest Neighbor Queries , 2010, IEEE Transactions on Knowledge and Data Engineering.

[11]  GaoYunjun,et al.  Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases , 2009 .

[12]  Walid G. Aref,et al.  SOLE: scalable on-line execution of continuous queries on spatio-temporal data streams , 2008, The VLDB Journal.

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

[14]  Tanzima Hashem,et al.  Countering overlapping rectangle privacy attack for moving kNN queries , 2013, Inf. Syst..

[15]  David Taniar,et al.  Indexing of Spatiotemporal Objects in Indoor Environments , 2013, 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA).

[16]  Lars Kulik,et al.  Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries , 2010, The VLDB Journal.

[17]  Kyriakos Mouratidis,et al.  A threshold-based algorithm for continuous monitoring of k nearest neighbors , 2005, IEEE Transactions on Knowledge and Data Engineering.

[18]  Yufei Tao,et al.  Time-parameterized queries in spatio-temporal databases , 2002, SIGMOD '02.

[19]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[20]  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).

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

[22]  Julius T. Tou,et al.  Information Systems , 1973, GI Jahrestagung.

[23]  Cyrus Shahabi,et al.  VoR-tree , 2010, Proc. VLDB Endow..

[24]  Xing Xie,et al.  Destination prediction by sub-trajectory synthesis and privacy protection against such prediction , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[25]  Rui Zhang,et al.  Visible Nearest Neighbor Queries , 2007, DASFAA.

[26]  Leonidas J. Guibas,et al.  Visibility-polygon search and euclidean shortest paths , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[28]  Bala R. Vatti.  A generic solution to polygon clipping , 1992, CACM.

[29]  Jianliang Xu,et al.  A generic framework for monitoring continuous spatial queries over moving objects , 2005, SIGMOD '05.

[30]  Kotagiri Ramamohanarao,et al.  Optimized algorithms for predictive range and KNN queries on moving objects , 2010, Inf. Syst..

[31]  Nick Roussopoulos,et al.  K-Nearest Neighbor Search for Moving Query Point , 2001, SSTD.

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

[33]  Yunjun Gao,et al.  Continuous visible nearest neighbor query processing in spatial databases , 2010, The VLDB Journal.

[34]  Lars Kulik,et al.  A motion-aware approach for efficient evaluation of continuous queries on 3D object databases , 2010, The VLDB Journal.

[35]  Lars Kulik,et al.  The V*-Diagram: a query-dependent approach to moving KNN queries , 2008, Proc. VLDB Endow..

[36]  S JensenChristian,et al.  Indexing the positions of continuously moving objects , 2000 .

[37]  David Taniar,et al.  Indexing Moving Objects in Indoor Cellular Space , 2012, 2012 15th International Conference on Network-Based Information Systems.

[38]  Christian S. Jensen,et al.  Main-Memory Operation Buffering for Efficient R-Tree Update , 2007, VLDB.

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