Incremental approach for Continuous k-Nearest Neighbours queries on road

被引：6

作者：

Khayati, Mourad ^{[1
]}

Akaichi, Jalel ^{[1
]}

机构：

[1] Department of Computer Science, Institut Superieur de Gestion, University of Tunis, 2000 Le Bardo, Tunis, 41, Rue de la Liberté

来源：

International Journal of Intelligent Information and Database Systems | 2008年 / 2卷 / 02期

关键词：

CkNNs; Continuous; Delaunay Triangulation; DT; Indexation; K-Nearest Neighbors; Location dependent services; Spatial network;

D O I：

10.1504/IJIIDS.2008.018255

中图分类号：

学科分类号：

摘要：

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. © 2008, Inderscience Publishers.

引用

页码：204 / 221

页数：17