{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:16:38Z","timestamp":1740122198626,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,1,7]],"date-time":"2017-01-07T00:00:00Z","timestamp":1483747200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Fundamental Research Funds for the Central Universities in China","award":["JUSRP11557"],"award-info":[{"award-number":["JUSRP11557"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572336","61472337"],"award-info":[{"award-number":["61572336","61472337"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10707-016-0288-4","type":"journal-article","created":{"date-parts":[[2017,1,7]],"date-time":"2017-01-07T03:03:21Z","timestamp":1483758201000},"page":"3-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Efficient evaluation of shortest travel-time path queries through spatial mashups"],"prefix":"10.1007","volume":"22","author":[{"given":"Detian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Yin","family":"Chow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangliang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingzhu","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,7]]},"reference":[{"key":"288_CR1","doi-asserted-by":"crossref","unstructured":"Bruno N, Chaudhuri S, Gravano L (2001) Stholes: a multidimensional workload-aware histogram. In: ACM SIGMOD","DOI":"10.1145\/375663.375686"},{"key":"288_CR2","doi-asserted-by":"crossref","unstructured":"Bruno N, Gravano L, Marian A (2002) Evaluating top-k queries over web-accessible databases. In: IEEE ICDE","DOI":"10.1109\/ICDE.2002.994751"},{"key":"288_CR3","doi-asserted-by":"crossref","unstructured":"Chang KCC, Hwang SW (2002) Minimal probing: supporting expensive predicates for top-k queries. In: ACM SIGMOD","DOI":"10.1145\/564691.564731"},{"key":"288_CR4","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press"},{"key":"288_CR5","doi-asserted-by":"crossref","unstructured":"Demiryurek U, Banaei-Kashani F, Shahabi C, Ranganathan A (2011) Online computation of fastest path in time-dependent spatial networks. In: SSTD","DOI":"10.1007\/978-3-642-22922-0_7"},{"key":"288_CR6","doi-asserted-by":"crossref","unstructured":"Ding B, Yu JX, Qin L (2008) Finding time-dependent shortest paths over large graphs. In: EDBT","DOI":"10.1145\/1353343.1353371"},{"key":"288_CR7","unstructured":"George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: SSTD"},{"key":"288_CR8","unstructured":"Google Maps: http:\/\/maps.google.com"},{"key":"288_CR9","unstructured":"Google Maps\/Google Earth APIs Terms of Service: http:\/\/code.google.com\/apis\/maps\/terms.html"},{"key":"288_CR10","doi-asserted-by":"crossref","unstructured":"Gutin G, Punnen AP (2006) The traveling salesman problem and its variations. Springer Science & Business Media","DOI":"10.1007\/b101971"},{"issue":"13","key":"288_CR11","first-page":"1618","volume":"6","author":"X Huang","year":"2013","unstructured":"Huang X, Cheng H, Li RH, Qin L, Yu JX (2013) Top-k structural diversity search in large networks. VLDB J 6(13):1618\u20131629","journal-title":"VLDB J"},{"key":"288_CR12","unstructured":"INRIX: http:\/\/www.inrix.com"},{"key":"288_CR13","doi-asserted-by":"crossref","unstructured":"Kosaraju SR, Park JK, Stein C (1994) Long tours and short superstrings. In: FOCS","DOI":"10.1109\/SFCS.1994.365696"},{"key":"288_CR14","doi-asserted-by":"crossref","unstructured":"Levandoski JJ, Mokbel MF, Khalefa ME (2010) Preference query evaluation over expensive attributes. In: CIKM","DOI":"10.1145\/1871437.1871481"},{"key":"288_CR15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.compind.2014.09.004","volume":"69","author":"J Li","year":"2015","unstructured":"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\u201391","journal-title":"Comput Ind"},{"issue":"1","key":"288_CR16","first-page":"235","volume":"27","author":"Y Li","year":"2015","unstructured":"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\u2013249","journal-title":"IEEE TKDE"},{"key":"288_CR17","doi-asserted-by":"crossref","unstructured":"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\u201377","DOI":"10.1109\/ICDE.2015.7113273"},{"key":"288_CR18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.compind.2014.09.006","volume":"69","author":"M Lu","year":"2015","unstructured":"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\u201371","journal-title":"Comput Ind"},{"issue":"1","key":"288_CR19","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MCOM.2015.7010514","volume":"53","author":"R Mao","year":"2015","unstructured":"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\u201347","journal-title":"IEEE Commun Mag"},{"issue":"2","key":"288_CR20","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s13042-016-0504-4","volume":"7","author":"R Mao","year":"2016","unstructured":"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\u2013323","journal-title":"Int J Mach Learn Cybern"},{"key":"288_CR21","unstructured":"MapQuest Directions Web Service: http:\/\/www.mapquestapi.com\/directions"},{"key":"288_CR22","unstructured":"MapQuest Maps: http:\/\/www.mapquestapi.com"},{"key":"288_CR23","unstructured":"Microsoft Bing Maps: http:\/\/www.bing.com\/maps"},{"key":"288_CR24","unstructured":"Navteq: https:\/\/www.navteq.com\/"},{"key":"288_CR25","unstructured":"ProgrammableWeb: http:\/\/www.programmableweb.com\/category-api"},{"issue":"4","key":"288_CR26","first-page":"45","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer C (2014) Shortest-path queries in static networks. ACM Comput Surv, CSUR 46(4):45","journal-title":"ACM Comput Surv, CSUR"},{"key":"288_CR27","unstructured":"The Google Directions API: https:\/\/developers.google.com\/maps\/documentation\/directions"},{"key":"288_CR28","unstructured":"The Google Places API: https:\/\/developers.google.com\/places\/"},{"key":"288_CR29","doi-asserted-by":"crossref","unstructured":"Thomsen JR, Yiu ML, Jensen CS (2012) Effective caching of shortest paths for location-based services. In: ACM SIGMOD","DOI":"10.1145\/2213836.2213872"},{"key":"288_CR30","unstructured":"TIGER\/Line Shapefiles 2009 for: Hennepin County, Minnesota: http:\/\/www2.census.gov\/cgi-bin\/shapefiles2009\/county-files?county=27053"},{"issue":"4","key":"288_CR31","first-page":"1012","volume":"26","author":"LH U","year":"2014","unstructured":"U LH, Zhao HJ, Yiu ML, Li Y, Gong Z (2014) Towards online shortest path computation. IEEE TKDE 26(4):1012\u20131025","journal-title":"IEEE TKDE"},{"key":"288_CR32","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.neucom.2015.04.076","volume":"167","author":"J Wang","year":"2015","unstructured":"Wang J, Huang JZ, Guo J, Lan Y (2015) Recommending high-utility search engine queries via a query-recommending model. Neurocomputing 167:195\u2013208","journal-title":"Neurocomputing"},{"key":"288_CR33","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.14778\/2140436.2140438"},{"key":"288_CR34","unstructured":"Yelp, Inc.: http:\/\/www.yelp.com"},{"key":"288_CR35","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/978-3-319-45814-4_9"},{"key":"288_CR36","doi-asserted-by":"crossref","unstructured":"Zhang D, Chow CY, Li Q, Zhang X, Xu Y (2011) Efficient evaluation of k-NN queries using spatial mashups. In: SSTD","DOI":"10.1007\/978-3-642-22922-0_21"},{"issue":"2","key":"288_CR37","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10619-012-7110-6","volume":"31","author":"D Zhang","year":"2013","unstructured":"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\u2013287","journal-title":"Distributed and Parallel Databases, DAPD"},{"issue":"8","key":"288_CR38","doi-asserted-by":"crossref","first-page":"2428","DOI":"10.1109\/TC.2015.2485215","volume":"65","author":"D Zhang","year":"2016","unstructured":"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\u20132442","journal-title":"IEEE Trans Comput"},{"key":"288_CR39","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/2463676.2465277"},{"key":"288_CR40","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.is.2014.12.005","volume":"49","author":"CJ Zhu","year":"2015","unstructured":"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\u2013162","journal-title":"Inf Syst"},{"issue":"4","key":"288_CR41","doi-asserted-by":"crossref","first-page":"387","DOI":"10.3233\/ICA-150498","volume":"22","author":"Z Zhu","year":"2015","unstructured":"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\u2013404","journal-title":"Integrated Computer-Aided Engineering"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-016-0288-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0288-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0288-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T03:36:31Z","timestamp":1568691391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-016-0288-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,7]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["288"],"URL":"https:\/\/doi.org\/10.1007\/s10707-016-0288-4","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2017,1,7]]}}}