Skip to main content
SpringerLink
Log in

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

  • Published:
GeoInformatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. If R(o i → d i ) is directional, o j and d j should locate in the route in order.

References

  1. Bruno N, Chaudhuri S, Gravano L (2001) Stholes: a multidimensional workload-aware histogram. In: ACM SIGMOD

  2. Bruno N, Gravano L, Marian A (2002) Evaluating top-k queries over web-accessible databases. In: IEEE ICDE

  3. Chang KCC, Hwang SW (2002) Minimal probing: supporting expensive predicates for top-k queries. In: ACM SIGMOD

  4. Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press

  5. Demiryurek U, Banaei-Kashani F, Shahabi C, Ranganathan A (2011) Online computation of fastest path in time-dependent spatial networks. In: SSTD

  6. Ding B, Yu JX, Qin L (2008) Finding time-dependent shortest paths over large graphs. In: EDBT

  7. George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: SSTD

  8. Google Maps: http://maps.google.com

  9. Google Maps/Google Earth APIs Terms of Service: http://code.google.com/apis/maps/terms.html

  10. Gutin G, Punnen AP (2006) The traveling salesman problem and its variations. Springer Science & Business Media

  11. Huang X, Cheng H, Li RH, Qin L, Yu JX (2013) Top-k structural diversity search in large networks. VLDB J 6(13):1618–1629

    Google Scholar 

  12. INRIX: http://www.inrix.com

  13. Kosaraju SR, Park JK, Stein C (1994) Long tours and short superstrings. In: FOCS

  14. Levandoski JJ, Mokbel MF, Khalefa ME (2010) Preference query evaluation over expensive attributes. In: CIKM

  15. Li J, Liu C, Liu B, Mao R, Wang Y, Chen S, Yang JJ, Pan H, Wang Q (2015) Diversity-aware retrieval of medical records. Comput Ind 69:81–91

    Article  Google Scholar 

  16. Li Y, Yiu ML (2015) Route-saver: leveraging route apis for accurate and efficient query processing at location-based services. IEEE TKDE 27(1):235–249

    Google Scholar 

  17. Liu A, Zheng K, Li L, Liu G, Zhao L, Zhou X (2015) Efficient secure similarity computation on encrypted trajectory data. In: IEEE ICDE, pp 66–77

  18. Lu M, Tang Y, Sun R, Wang T, Chen S, Mao R (2015) A real time displacement estimation algorithm for ultrasound elastography. Comput Ind 69:61–71

    Article  Google Scholar 

  19. Mao R, Xu H, Wu W, Li J, Li Y, Lu M (2015) Overcoming the challenge of variety: big data abstraction, the next evolution of data management for aal communication systems. IEEE Commun Mag 53(1):42–47

    Article  Google Scholar 

  20. Mao R, Zhang P, Li X, Liu X, Lu M (2016) Pivot selection for metric-space indexing. Int J Mach Learn Cybern 7(2):311–323

    Article  Google Scholar 

  21. MapQuest Directions Web Service: http://www.mapquestapi.com/directions

  22. MapQuest Maps: http://www.mapquestapi.com

  23. Microsoft Bing Maps: http://www.bing.com/maps

  24. Navteq: https://www.navteq.com/

  25. ProgrammableWeb: http://www.programmableweb.com/category-api

  26. Sommer C (2014) Shortest-path queries in static networks. ACM Comput Surv, CSUR 46(4):45

    Google Scholar 

  27. The Google Directions API: https://developers.google.com/maps/documentation/directions

  28. The Google Places API: https://developers.google.com/places/

  29. Thomsen JR, Yiu ML, Jensen CS (2012) Effective caching of shortest paths for location-based services. In: ACM SIGMOD

  30. TIGER/Line Shapefiles 2009 for: Hennepin County, Minnesota: http://www2.census.gov/cgi-bin/shapefiles2009/county-files?county=27053

  31. U LH, Zhao HJ, Yiu ML, Li Y, Gong Z (2014) Towards online shortest path computation. IEEE TKDE 26(4):1012–1025

    Google Scholar 

  32. Wang J, Huang JZ, Guo J, Lan Y (2015) Recommending high-utility search engine queries via a query-recommending model. Neurocomputing 167:195–208

    Article  Google Scholar 

  33. Wu L, Xiao X, Deng D, Cong G, Zhu AD, Zhou S (2012) Shortest path and distance queries on road networks: an experimental evaluation. In: VLDB

  34. Yelp, Inc.: http://www.yelp.com

  35. Zhang D, Chow CY, Li Q, Liu A (2016) Efficient evaluation of shortest travel-time path queries in road networks by optimizing waypoints in route requests through spatial mashups. In: APWEb

  36. Zhang D, Chow CY, Li Q, Zhang X, Xu Y (2011) Efficient evaluation of k-NN queries using spatial mashups. In: SSTD

  37. Zhang D, Chow CY, Li Q, Zhang X, Xu Y (2013) SMAshq: Spatial mashup framework for k-NN queries in time-dependent road networks. Distributed and Parallel Databases, DAPD 31(2):259–287

    Article  Google Scholar 

  38. Zhang D, Chow CY, Li Q, Zhang X, Xu Y (2016) A spatial mashup service for efficient evaluation of concurrent k-nn queries. IEEE Trans Comput 65(8):2428–2442

    Article  Google Scholar 

  39. Zhu AD, Ma H, Xiao X, Luo S, Tang Y, Zhou S (2013) Shortest path and distance queries on road networks: towards bridging theory and practice. In: ACM SIGMOD

  40. Zhu CJ, Lam KY, Cheng RC, Poon CK (2015) On using broadcast index for efficient execution of shortest path continuous queries. Inf Syst 49:142–162

    Article  Google Scholar 

  41. Zhu Z, Xiao J, Li J, Wang F, Zhang Q (2015) Global path planning of wheeled robots using multi-objective memetic algorithms. Integrated Computer-Aided Engineering 22(4):387–404

    Article  Google Scholar 

Download references

Acknowledgments

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).

Author information

Authors and Affiliations

  1. School of Digital Media, Jiangnan University, Wuxi, China

    Detian Zhang

  2. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong

    Chi-Yin Chow & Qing Li

  3. King Abdullah University of Science and Technology, Thuwal, 23955-6900, Kingdom of Saudi Arabia

    An Liu & Xiangliang Zhang

  4. School of Computer Science, Soochow University, Suzhou, China

    An Liu & Qingzhu Ding

  5. Multimedia Software Engineering Research Center, City University of Hong Kong Shenzhen Research Institute, Shenzhen, Guangdong, China

    Qing Li

Authors
  1. Detian Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chi-Yin Chow
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. An Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiangliang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Qingzhu Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Qing Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to An Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, D., Chow, CY., Liu, A. et al. Efficient evaluation of shortest travel-time path queries through spatial mashups. Geoinformatica 22, 3–28 (2018). https://doi.org/10.1007/s10707-016-0288-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-016-0288-4

Keywords

Search

Navigation