Abstract
Query processing in road networks has been studied extensively in recent years. However, the processing of moving queries in road networks has received little attention. In this paper, we introduce a new algorithm called the Safe Exit Algorithm (SEA), which can efficiently compute the safe exit points of a moving nearest neighbor (NN) query on road networks. The safe region of a query is an area where the query result remains unchanged, provided that the query remains inside the safe region At each safe exit point, the safe region of a query and its non-safe region meet so that a set of safe exit points represents the border of the safe region. Before reaching a safe exit point, the client (query object) does not have to request the server to re-evaluate the query This significantly reduces the server processing costs and the communication costs between the server and moving clients. Extensive experimental results show that SEA outperforms a conventional algorithm by up to two orders of magnitude in terms of communication costs and computation costs.
Highlights
The points of interest (POIs; e.g., accommodation, restaurants, and gas stations) marked on web mapping services such as Google Maps, Bing Maps, and Yahoo Maps are located in a road network and their proximity is measured as their shortest path distances [7,8,13,14]
We address this issue by proposing a new Safe Exit Algorithm (SEA), which efficiently computes the safe exit points for moving nearest neighbor (NN) queries in road networks
– We propose a Safe Exit Algorithm (SEA) for the continuous monitoring of moving NN queries over static objects by assuming that the path is not known in advance and that query points move arbitrarily in road networks
Summary
The points of interest (POIs; e.g., accommodation, restaurants, and gas stations) marked on web mapping services such as Google Maps, Bing Maps, and Yahoo Maps are located in a road network and their proximity is measured as their shortest path distances [7,8,13,14]. Cho et al / A safe exit algorithm for continuous nearest neighbor monitoring in road networks is to find the k-nearest objects of interest to a user’s current location while he/she moves freely. The network bandwidth required to provide the client with a safe region (which may consist of complex road segments) is more than that required to provide a set of safe exit points [26] that represent the boundary of the corresponding safe region We address this issue by proposing a new Safe Exit Algorithm (SEA), which efficiently computes the safe exit points for moving NN queries in road networks. – We propose a Safe Exit Algorithm (SEA) for the continuous monitoring of moving NN queries over static objects by assuming that the path is not known in advance and that query points move arbitrarily in road networks.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
