Title: Incremental approach for Continuous k-Nearest Neighbours queries on road

Authors: Mourad Khayati, Jalel Akaichi

Addresses: Department of Computer Science, Institut Superieur de Gestion, University of Tunis, 41, Rue de la Liberte, cite Bouchoucha, 2000 Le Bardo, Tunis, Tunisia. ' Department of Computer Science, Institut Superieur de Gestion, University of Tunis, 41, Rue de la Liberte, cite Bouchoucha, 2000 Le Bardo, Tunis, Tunisia

Abstract: 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.

Keywords: location dependent services; k-nearest neighbours; continuous kNNs; CkNNs; indexation; Delaunay triangulation; spatial networks; location based services; LBS; road networks.

DOI: 10.1504/IJIIDS.2008.018255

International Journal of Intelligent Information and Database Systems, 2008 Vol.2 No.2, pp.204 - 221

Available online: 13 May 2008 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article