{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T12:55:31Z","timestamp":1760100931507},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458137"},{"type":"electronic","value":"9783319458144"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45814-4_9","type":"book-chapter","created":{"date-parts":[[2016,9,16]],"date-time":"2016-09-16T02:23:54Z","timestamp":1473992634000},"page":"104-115","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Evaluation of Shortest Travel-Time Path Queries in Road Networks by Optimizing Waypoints in Route Requests Through Spatial\u00a0Mashups"],"prefix":"10.1007","author":[{"given":"Detian","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Chi-Yin","family":"Chow","sequence":"additional","affiliation":[]},{"given":"Qing","family":"Li","sequence":"additional","affiliation":[]},{"given":"An","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,17]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Zhang, D., Chow, C.Y., Li, Q., Zhang, X., Xu, Y.: Efficient evaluation of k-NN queries using spatial mashups. In: SSTD (2011)","DOI":"10.1007\/978-3-642-22922-0_21"},{"issue":"2","key":"9_CR2","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, C.Y., Li, Q., Zhang, X., Xu, Y.: SMashQ: spatial mashup framework for k-NN queries in time-dependent road networks. Distrib. Parallel Databases DAPD 31(2), 259\u2013287 (2013)","journal-title":"Distrib. Parallel Databases DAPD"},{"key":"9_CR3","unstructured":"Zhang, D., Chow, C.Y., Li, Q., Zhang, X., Xu, Y.: A spatial mashup service for efficient evaluation of concurrent k-nn queries. IEEE Trans. Comput. (accepted to appear)"},{"issue":"1","key":"9_CR4","first-page":"235","volume":"27","author":"Y Li","year":"2015","unstructured":"Li, Y., Yiu, M.L.: Route-saver: leveraging route apis for accurate and efficient query processing at location-based services. IEEE TKDE 27(1), 235\u2013249 (2015)","journal-title":"IEEE TKDE"},{"key":"9_CR5","unstructured":"ProgrammableWeb. http:\/\/www.programmableweb.com\/category-api"},{"key":"9_CR6","unstructured":"The Google Directions API. https:\/\/developers.google.com\/maps\/documentation\/directions"},{"key":"9_CR7","unstructured":"MapQuest Directions Web Service. http:\/\/www.mapquestapi.com\/directions"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Levandoski, J.J., Mokbel, M.F., Khalefa, M.E.: Preference query evaluation over expensive attributes. In: CIKM (2010)","DOI":"10.1145\/1871437.1871481"},{"key":"9_CR9","unstructured":"Google Maps\/Google Earth APIs Terms of Service. http:\/\/code.google.com\/apis\/maps\/terms.html"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Wu, L., Xiao, X., Deng, D., Cong, G., Zhu, A.D., Zhou, S.: Shortest path and distance queries on road networks: an experimental evaluation. In: VLDB (2012)","DOI":"10.14778\/2140436.2140438"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Zhu, A.D., Ma, H., Xiao, X., Luo, S., Tang, Y., Zhou, S.: Shortest path and distance queries on road networks: towards bridging theory and practice. In: ACM SIGMOD (2013)","DOI":"10.1145\/2463676.2465277"},{"issue":"4","key":"9_CR12","doi-asserted-by":"crossref","first-page":"45:1","DOI":"10.1145\/2530531","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer, C.: Shortest-path queries in static networks. ACM Comput. Surv. (CSUR) 46(4), 45:1\u201345:31 (2014)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/978-3-642-22922-0_7","volume-title":"Advances in Spatial and Temporal Databases","author":"U Demiryurek","year":"2011","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C., Ranganathan, A.: Online computation of fastest path in time-dependent spatial networks. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 92\u2013111. Springer, Heidelberg (2011)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/978-3-540-73540-3_26","volume-title":"Advances in Spatial and Temporal Databases","author":"B George","year":"2007","unstructured":"George, B., Kim, S., Shekhar, S.: Spatio-temporal network databases and routing algorithms: a summary of results. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 460\u2013477. Springer, Heidelberg (2007)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT (2008)","DOI":"10.1145\/1353343.1353371"},{"key":"9_CR16","unstructured":"Bruno, N., Gravano, L., Marian, A.: Evaluating top- $$k$$ queries over web-accessible databases. In: IEEE ICDE (2002)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Chang, K.C.C., Hwang, S.W.: Minimal probing: supporting expensive predicates for top- $$k$$ queries. In: ACM SIGMOD (2002)","DOI":"10.1145\/564691.564731"},{"key":"9_CR18","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Thomsen, J.R., Yiu, M.L., Jensen, C.S.: Effective caching of shortest paths for location-based services. In: ACM SIGMOD (2012)","DOI":"10.1145\/2213836.2213872"},{"issue":"1","key":"9_CR20","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF02523689","volume":"18","author":"D Karger","year":"1997","unstructured":"Karger, D., Motwani, R., Ramkumar, G.: On approximating the longest path in a graph. Algorithmica 18(1), 82\u201398 (1997)","journal-title":"Algorithmica"},{"key":"9_CR21","unstructured":"The Google Places API. https:\/\/developers.google.com\/places\/"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45814-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T15:34:06Z","timestamp":1568388846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45814-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458137","9783319458144"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45814-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}