Show simple item record

dc.contributor.authorZhang, Detian
dc.contributor.authorChow, Chi-Yin
dc.contributor.authorLiu, An
dc.contributor.authorZhang, Xiangliang
dc.contributor.authorDing, Qingzhu
dc.contributor.authorLi, Qing
dc.date.accessioned2017-01-29T13:51:40Z
dc.date.available2017-01-29T13:51:40Z
dc.date.issued2017-01-07
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.
dc.identifier.issn1384-6175
dc.identifier.issn1573-7624
dc.identifier.doi10.1007/s10707-016-0288-4
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.
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).
dc.publisherSpringer Nature
dc.relation.urlhttp://link.springer.com/article/10.1007%2Fs10707-016-0288-4
dc.rightsThe final publication is available at Springer via http://dx.doi.org/10.1007/s10707-016-0288-4
dc.subjectPath queries
dc.subjectTravel time
dc.subjectSpatial mashups
dc.subjectDirection sharing
dc.subjectParallel requesting
dc.subjectWaypoints
dc.subjectWeb mapping services
dc.titleEfficient evaluation of shortest travel-time path queries through spatial mashups
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentComputer Science Program
dc.identifier.journalGeoInformatica
dc.eprint.versionPost-print
dc.contributor.institutionSchool of Digital Media, Jiangnan University, Wuxi, China
dc.contributor.institutionDepartment of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
dc.contributor.institutionSchool of Computer Science, Soochow University, Suzhou, China
dc.contributor.institutionMultimedia Software Engineering Research Center, City University of Hong Kong, Shenzhen Research Institute, Shenzhen, China
kaust.personLiu, An
kaust.personZhang, Xiangliang
refterms.dateFOA2018-01-07T00:00:00Z
dc.date.published-online2017-01-07
dc.date.published-print2018-01


Files in this item

Thumbnail
Name:
Geoinformatica2018.pdf
Size:
2.759Mb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record