Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Lai, C., Wang, L., Chen, J., Meng, X., & Zeitouni, K. (2007). Effective density queries for moving objects in road networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4505 LNCS, pp. 200–211). Springer Verlag. https://doi.org/10.1007/978-3-540-72524-4_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
