Effective Density Queries for Moving Objects in Road Networks - Université de Lille Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Effective Density Queries for Moving Objects in Road Networks


Recent research has focused on density queries for moving objects in highly dynamic scenarios. An area is dense if the number of moving objects it contains is above some threshold. Monitoring dense areas has applications in traffic control systems, bandwidth management, collision probability evaluation, etc. All existing methods, however, assume the objects moving in the Euclidean space. In this paper, we study the density queries in road networks, where density computation is determined by the length of the road segment and the number of objects on it. We define an effective road-network density query guaranteeing to obtain useful answers. We then propose the cluster-based algorithm for the efficient computation of density queries for objects moving in road networks. Extensive experimental results show that our methods achieve high efficiency and accuracy for finding the dense areas in road networks.
Fichier principal
Vignette du fichier
Density_Queries_for_Moving_Objects_in_Road_Network.pdf (250.63 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04371614 , version 1 (03-01-2024)




Caifeng Lai, Ling Wang, Jidong Chen, Xiaofeng Meng, Karine Zeitouni. Effective Density Queries for Moving Objects in Road Networks. APWeb WAIM 2007 Asia-Pacific Web Conference International Conference on Web-Age Information Management, Jun 2007, Huang Shan, China. pp.200-211, ⟨10.1007/978-3-540-72524-4_23⟩. ⟨hal-04371614⟩
11 Consultations
5 Téléchargements



Gmail Mastodon Facebook X LinkedIn More