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

Handle URI:
http://hdl.handle.net/10754/622796
Title:
Efficient evaluation of shortest travel-time path queries through spatial mashups
Authors:
Zhang, Detian; Chow, Chi-Yin; Liu, An; Zhang, Xiangliang ( 0000-0002-3574-5665 ) ; Ding, Qingzhu; Li, Qing
Abstract:
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer Science Program
Citation:
Zhang D, Chow C-Y, Liu A, Zhang X, Ding Q, et al. (2017) Efficient evaluation of shortest travel-time path queries through spatial mashups. GeoInformatica 22: 3–28. Available: http://dx.doi.org/10.1007/s10707-016-0288-4.
Publisher:
Springer Nature
Journal:
GeoInformatica
Issue Date:
7-Jan-2017
DOI:
10.1007/s10707-016-0288-4
Type:
Article
ISSN:
1384-6175; 1573-7624
Sponsors:
Research reported in this publication was partially supported by King Abdullah University of Science and Technology (KAUST), the Fundamental Research Funds for the Central Universities in China (Project No. JUSRP11557), the National Natural Science Foundation of China (Project No. 61572336 and 61472337), and a Strategic Research Grant from City University of Hong Kong (Project No. 7004420).
Additional Links:
http://link.springer.com/article/10.1007%2Fs10707-016-0288-4
Appears in Collections:
Articles; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorZhang, Detianen
dc.contributor.authorChow, Chi-Yinen
dc.contributor.authorLiu, Anen
dc.contributor.authorZhang, Xiangliangen
dc.contributor.authorDing, Qingzhuen
dc.contributor.authorLi, Qingen
dc.date.accessioned2017-01-29T13:51:40Z-
dc.date.available2017-01-29T13:51:40Z-
dc.date.issued2017-01-07en
dc.identifier.citationZhang D, Chow C-Y, Liu A, Zhang X, Ding Q, et al. (2017) Efficient evaluation of shortest travel-time path queries through spatial mashups. GeoInformatica 22: 3–28. Available: http://dx.doi.org/10.1007/s10707-016-0288-4.en
dc.identifier.issn1384-6175en
dc.identifier.issn1573-7624en
dc.identifier.doi10.1007/s10707-016-0288-4en
dc.identifier.urihttp://hdl.handle.net/10754/622796-
dc.description.abstractIn 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.en
dc.description.sponsorshipResearch reported in this publication was partially supported by King Abdullah University of Science and Technology (KAUST), the Fundamental Research Funds for the Central Universities in China (Project No. JUSRP11557), the National Natural Science Foundation of China (Project No. 61572336 and 61472337), and a Strategic Research Grant from City University of Hong Kong (Project No. 7004420).en
dc.publisherSpringer Natureen
dc.relation.urlhttp://link.springer.com/article/10.1007%2Fs10707-016-0288-4en
dc.rightsThe final publication is available at Springer via http://dx.doi.org/10.1007/s10707-016-0288-4en
dc.subjectPath queriesen
dc.subjectTravel timeen
dc.subjectSpatial mashupsen
dc.subjectDirection sharingen
dc.subjectParallel requestingen
dc.subjectWaypointsen
dc.subjectWeb mapping servicesen
dc.titleEfficient evaluation of shortest travel-time path queries through spatial mashupsen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentComputer Science Programen
dc.identifier.journalGeoInformaticaen
dc.eprint.versionPost-printen
dc.contributor.institutionSchool of Digital Media, Jiangnan University, Wuxi, Chinaen
dc.contributor.institutionDepartment of Computer Science, City University of Hong Kong, Kowloon, Hong Kongen
dc.contributor.institutionSchool of Computer Science, Soochow University, Suzhou, Chinaen
dc.contributor.institutionMultimedia Software Engineering Research Center, City University of Hong Kong, Shenzhen Research Institute, Shenzhen, Chinaen
kaust.authorLiu, Anen
kaust.authorZhang, Xiangliangen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.