On using broadcast index for efficient execution of shortest path continuous queries

Zhu, Chun Jiang; Lam, Kam-Yiu; Cheng, Reynold; Poon, Chung Keung

doi:10.1016/j.is.2014.12.005

Cited by 7 publications

(2 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, they still cannot reflect live traffic information, which can be affected by sudden events, e.g., congestions, accidents, and road maintenance. Hence, another interesting approach for shortest path query processing is to let the server (e.g., NAVTEQ [24], and INRIX [12]) collect live traffic information and then broadcast them over radio or wireless network to clients, who listen to the live traffic index and read the relevant portion of the index for deriving the shortest path by themselves [31,40]. This paper focuses on the shortest travel-time route (or path) queries in time-dependent road networks.…”

Section: Related Workmentioning

confidence: 99%

“…This paper focuses on the shortest travel-time route (or path) queries in time-dependent road networks. Our work distinguishes itself from previous work in that it does not model the underlying road network based on different criteria [5][6][7], or broadcast live traffic information to clients [31,40]. Instead, it employs external Web mapping services, e.g., Google Maps, to provide the real-time route information in a road network though their user-friendly APIs.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient evaluation of shortest travel-time path queries through spatial mashups

et al. 2017

View full text Add to dashboard Cite

In the real world, the route/path with the shortest travel time in a road network is more meaningful than that with the shortest network distance for location-based services (LBS). However, not every LBS provider has adequate resources to compute/estimate travel time for routes by themselves. A cost-effective way for LBS providers to estimate travel time for routes is to issue external route requests to Web mapping services (e.g., Google Maps, Bing Maps, and MapQuest Maps). Due to the high cost of processing such external route requests and the usage limits of Web mapping services, we take the advantage of direction sharing, parallel requesting and waypoints supported by Web mapping services to reduce the number of external route requests and the query response time for shortest travel-time route queries in this paper. We first give the definition of sharing ability to reflect the possibility of sharing the direction information of a route with others, and find out the queries that their query routes are independent with each other for parallel processing. Then, we model the problem of selecting the optimal waypoints for an external route request as finding the longest simple path in a weighted complete digraph. As it is a MAX SNP-hard problem, we propose a greedy algorithm with performance guarantee to find the best set of waypoints in an external route request. We evaluate the performance of our approach using a real Web mapping service, a real road network, real and synthetic data sets. Experimental results show the efficiency, scalability, and applicability of our approach.

show abstract

Section: Related Workmentioning

confidence: 99%