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.
منابع مشابه
Continuous Skyline Queries for Moving Objects in Road Networks
Skyline queries in road networks have received much attention because of their wide applications in LBS. Due to the increasing demands for services, skyline queries for moving objects in road networks which involve not only static attributes, but also dynamic ones, become more important. This paper studies a problem of how to process the continuous skyline query for moving objects in road netwo...
متن کاملExtending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths
Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...
متن کاملLocation-based Query Processing on Moving Objects in Road Networks∗
Location-based services are increasingly popular. In this paper, we present our novel design of a system to process location-based queries on MOVing objects in road Networks (MOVNet, for short) that efficiently handles a large number of spatial queries over moving objects in a stationary road network. MOVNet utilizes an on-disk R-tree to store the network connectivities and an in-memory grid in...
متن کاملThe SSP-Tree: A Method for Distributed Processing of Range Monitoring Queries in Road Networks
This paper addresses the problem of processing range monitoring queries, each of which continuously retrieves moving objects that are currently located within a given query range. In particular, this paper focuses on processing range monitoring queries in the road network, where movements of the objects are constrained by a predefined set of paths. One of the most important challenges of proces...
متن کاملContinuous Monitoring of Top- k Spatial Keyword Queries in Road Networks
Recently, spatial keyword queries (SKQ) have become a hot topic in database field. However, Most of the existing SKQ methods are limited in Euclidean space or assume that objects (and queries) are static. This paper addresses the issue of processing continuous top-k spatial keyword queries over moving objects (CMTkSK) in road networks. To efficiently index moving geo-textual objects in road net...
متن کامل