Incremental approach for Continuous k-Nearest Neighbours queries on road

With the integration of wireless communication and positioning technologies, Location Based Services (LBSs) contribute to the enhancement of spatial databases applications and the efficiency of pervasive systems. This is ensured by providing efficient responses for location dependent queries triggered by mobile users. In this paper, we propose a new approach based on Delaunay Triangulation (DT) and the determination of Nearest Neighbors (NNs), which constitutes an important class of problems in LBS. We show that our approach, applied on road networks, is able to establish the Continuous k-Nearest Neighbors (CkNNs) while taking into account the dynamic changes of locations from which the queries are issued.

[1]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

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

[3]  Shin'ichi Satoh,et al.  The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

[4]  Cyrus Shahabi,et al.  Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases , 2004, VLDB.

[5]  Cyrus Shahabi,et al.  Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases , 2005, STDBM.

[6]  Toyohide Watanabe,et al.  Search of Continuous Nearest Target Objects along Route on Large Hierarchical Road Network , 2003 .

[7]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[10]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2005, IEEE Trans. Wirel. Commun..

[11]  Chin-Wan Chung,et al.  An Efficient and Scalable Approach to CNN Queries in a Road Network , 2005, VLDB.

[12]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[13]  Kyriakos Mouratidis,et al.  Continuous monitoring of top-k queries over sliding windows , 2006, SIGMOD Conference.

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

[15]  Vid Domiter.  Constrained Delaunay Triangulation using Plane Subdivision , 2004 .