{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:42:31Z","timestamp":1761324151430,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T00:00:00Z","timestamp":1523836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702227"],"award-info":[{"award-number":["61702227"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s11280-018-0549-2","type":"journal-article","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T04:29:35Z","timestamp":1523852975000},"page":"455-475","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Effective shortest travel-time path caching and estimating for location-based services"],"prefix":"10.1007","volume":"22","author":[{"given":"Detian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2355-288X","authenticated-orcid":false,"given":"Zhixu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gangyong","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Chen","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":[[2018,4,16]]},"reference":[{"issue":"5824","key":"549_CR1","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H Bast","year":"2007","unstructured":"Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. Science 316(5824), 566\u2013566 (2007)","journal-title":"Science"},{"issue":"1","key":"549_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Quart. Appl. Math. 16(1), 87\u201390 (1958)","journal-title":"Quart. Appl. Math."},{"key":"549_CR3","doi-asserted-by":"crossref","unstructured":"Chen, F., Zhang, D., Zhang, J., Wang, X., Chen, L., Liu, Y., Liu, J.: Distribution-aware cache replication for cooperative road side units in vanets. Peer-to-Peer Network. Appl., 1\u201310 (2017)","DOI":"10.1007\/s12083-017-0582-4"},{"key":"549_CR4","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)"},{"issue":"7","key":"549_CR5","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.jpdc.2012.02.007","volume":"73","author":"D Delling","year":"2013","unstructured":"Delling, D., Goldberg, A. V., Nowatzyk, A., Werneck, R. F.: Phast: hardware-accelerated shortest path trees. J. Parallel Distrib. Comput. 73(7), 940\u2013952 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"key":"549_CR6","doi-asserted-by":"crossref","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: Efficient k-nearest neighbor search in time-dependent spatial networks. In: DEXA (2010)","DOI":"10.1007\/978-3-642-15364-8_36"},{"key":"549_CR7","doi-asserted-by":"crossref","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C., Ranganathan, A.: Online computation of fastest path in time-dependent spatial networks. In: SSTD (2011)","DOI":"10.1007\/978-3-642-22922-0_7"},{"issue":"1","key":"549_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E. W.: A note on two problems in connexion with graphs. Numerische mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische mathematik"},{"key":"549_CR9","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"},{"issue":"9","key":"549_CR10","doi-asserted-by":"publisher","first-page":"2045","DOI":"10.1109\/TMM.2017.2729019","volume":"19","author":"L Gao","year":"2017","unstructured":"Gao, L., Guo, Z., Zhang, H., Xu, X., Shen, H. T.: Video captioning with attention-based lstm and semantic consistency. IEEE Trans. Multimed. 19(9), 2045\u20132055 (2017)","journal-title":"IEEE Trans. Multimed."},{"issue":"3","key":"549_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00530-015-0494-1","volume":"23","author":"L Gao","year":"2017","unstructured":"Gao, L., Song, J., Liu, X., Shao, J., Liu, J., Shao, J.: Learning in high-dimensional multimedia data: The state of the art. Multimed. Syst. 23(3), 303\u2013313 (2017)","journal-title":"Multimed. Syst."},{"key":"549_CR12","unstructured":"George, B., Kim, S., Shekhar, S.: Spatio-temporal network databases and routing algorithms: A summary of results. In: SSTD (2007)"},{"issue":"2","key":"549_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P. E., Nilsson, N. J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"549_CR14","unstructured":"INRIX: http:\/\/www.inrix.com"},{"issue":"9","key":"549_CR15","first-page":"672","volume":"9","author":"V Kalavri","year":"2016","unstructured":"Kalavri, V., Simas, T., Logothetis, D.: The shortest path is not always a straight line: Leveraging semi-metricity in graph analysis. PVLDB 9(9), 672\u2013683 (2016)","journal-title":"PVLDB"},{"key":"549_CR16","doi-asserted-by":"crossref","unstructured":"Levandoski, J. J., Mokbel, M. F., Khalefa, M. E.: Preference query evaluation over expensive attributes. In: CIKM, pp. 319\u2013328 (2010)","DOI":"10.1145\/1871437.1871481"},{"issue":"1","key":"549_CR17","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"},{"issue":"11","key":"549_CR18","doi-asserted-by":"publisher","first-page":"5324","DOI":"10.1109\/TIP.2017.2729896","volume":"26","author":"X Liu","year":"2017","unstructured":"Liu, X., Li, Z., Deng, C., Tao, D.: Distributed adaptive binary quantization for fast nearest neighbor search. IEEE Trans. Image Process. 26(11), 5324\u20135336 (2017)","journal-title":"IEEE Trans. Image Process."},{"key":"549_CR19","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M. H., Bik, A. J., Dehnert, J. C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: A system for large-scale graph processing. In: SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"issue":"1","key":"549_CR20","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0196-6774(03)00076-2","volume":"49","author":"U Meyer","year":"2003","unstructured":"Meyer, U., Sanders, P.: Delta-stepping: A parallelizable shortest path algorithm. J. Algor. 49(1), 114\u2013152 (2003)","journal-title":"J. Algor."},{"key":"549_CR21","unstructured":"Navteq: https:\/\/www.navteq.com"},{"issue":"4","key":"549_CR22","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/954339.954341","volume":"35","author":"S Podlipnig","year":"2003","unstructured":"Podlipnig, S., B\u00f6sz\u00f6rmenyi, L.: A survey of Web cache replacement strategies. ACM Comput. Surv. 35(4), 374\u2013398 (2003)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"549_CR23","first-page":"8","volume":"18","author":"L Shi","year":"2013","unstructured":"Shi, L., Li, J., Jason Xue, C., Zhou, X.: Hybrid nonvolatile disk cache for energy-efficient and high-performance systems. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 18(1), 8 (2013)","journal-title":"ACM Trans. Des. Autom. Electron. Syst. (TODAES)"},{"issue":"12","key":"549_CR24","doi-asserted-by":"publisher","first-page":"2779","DOI":"10.1109\/TVLSI.2013.2294462","volume":"22","author":"L Shi","year":"2014","unstructured":"Shi, L., Li, J., Li, Q., Xue, C. J., Yang, C., Zhou, X.: A unified write buffer cache management scheme for flash memory. IEEE Trans. Very Large Scale Integr.(VLSI) Syst. 22(12), 2779\u20132792 (2014)","journal-title":"IEEE Trans. Very Large Scale Integr.(VLSI) Syst."},{"issue":"3","key":"549_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/3959.3961","volume":"3","author":"AJ Smith","year":"1985","unstructured":"Smith, A. J.: Disk cache\u2014miss ratio analysis and design considerations. ACM Trans. Comput. Syst. 3(3), 161\u2013203 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"11","key":"549_CR26","doi-asserted-by":"publisher","first-page":"4999","DOI":"10.1109\/TIP.2016.2601260","volume":"25","author":"J Song","year":"2016","unstructured":"Song, J., Gao, L., Nie, F., Shen, H. T., Yan, Y., Sebe, N.: Optimized graph learning using partial tags and multiple features for image and video annotation. IEEE Trans. Image Process. 25(11), 4999\u20135011 (2016)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"549_CR27","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/TMM.2016.2515990","volume":"18","author":"J Song","year":"2016","unstructured":"Song, J., Shen, H. T., Wang, J., Huang, Z., Sebe, N., Wang, J.: A distance-computation-free search scheme for binary code databases. IEEE Trans. Multimed. 18(3), 484\u2013495 (2016)","journal-title":"IEEE Trans. Multimed."},{"key":"549_CR28","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.patcog.2017.03.021","volume":"75","author":"J Song","year":"2018","unstructured":"Song, J., Gao, L., Liu, L., Zhu, X., Sebe, N.: Quantization-based hashing: A general framework for scalable image and video retrieval. Pattern Recogn. 75, 175\u2013187 (2018)","journal-title":"Pattern Recogn."},{"issue":"6","key":"549_CR29","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/2.55497","volume":"23","author":"P Stenstrom","year":"1990","unstructured":"Stenstrom, P.: A survey of cache coherence schemes for multiprocessors. Computer 23(6), 12\u201324 (1990)","journal-title":"Computer"},{"key":"549_CR30","doi-asserted-by":"crossref","unstructured":"Thomsen, J. R., Yiu, M. L., Jensen, C. S.: Effective caching of shortest paths for location-based services. In: SIGMOD (2012)","DOI":"10.1145\/2213836.2213872"},{"issue":"4","key":"549_CR31","first-page":"1012","volume":"26","author":"LH U","year":"2014","unstructured":"U, L.H., Zhao, H.J., Yiu, M.L., Li, Y., Gong, Z.: Towards online shortest path computation. IEEE TKDE 26(4), 1012\u20131025 (2014)","journal-title":"IEEE TKDE"},{"key":"549_CR32","doi-asserted-by":"crossref","unstructured":"Wang, X., Pang, X., Luo, Y.: Lbs-p: A lbs platform supporting online map services. In: 2010 IEEE 72nd on Vehicular Technology Conference Fall (VTC 2010-Fall), pp. 1\u20135. IEEE (2010)","DOI":"10.1109\/VETECF.2010.5594114"},{"key":"549_CR33","doi-asserted-by":"crossref","unstructured":"Wang, X., Gao, L., Wang, P., Sun, X., Liu, X.: Two-stream 3d convnet fusion for action recognition in videos with arbitrary size and length. IEEE Transactions on Multimedia (2017)","DOI":"10.1109\/TMM.2017.2749159"},{"key":"549_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, D., Chow, C. Y., Li, Q., Liu, A.: Efficient evaluation of shortest travel-time path queries in road networks by optimizing waypoints in route requests through spatial mashups. In: APWeb (2016)","DOI":"10.1007\/978-3-319-45814-4_9"},{"key":"549_CR35","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, pp. 348\u2013366 (2011)","DOI":"10.1007\/978-3-642-22922-0_21"},{"issue":"2","key":"549_CR36","doi-asserted-by":"publisher","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 31(2), 259\u2013287 (2013)","journal-title":"Distrib. Parallel Databases"},{"issue":"8","key":"549_CR37","doi-asserted-by":"publisher","first-page":"2428","DOI":"10.1109\/TC.2015.2485215","volume":"65","author":"D Zhang","year":"2016","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. 65 (8), 2428\u20132442 (2016)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"549_CR38","first-page":"951","volume":"28","author":"Y Zhang","year":"2016","unstructured":"Zhang, Y., Hsueh, Y. L., Lee, W. C., Jhang, Y. H.: Efficient cache-supported path planning on roads. IEEE TKDE 28(4), 951\u2013964 (2016)","journal-title":"IEEE TKDE"},{"key":"549_CR39","doi-asserted-by":"crossref","unstructured":"Zhang, D., Liu, A., Jia, G., Chen, F., Li, Q., Li, J.: Effective caching of shortest travel-time paths for Web mapping mashup systems. In: WISE (2017)","DOI":"10.1007\/978-3-319-68783-4_29"},{"key":"549_CR40","doi-asserted-by":"publisher","first-page":"12,963","DOI":"10.1109\/ACCESS.2017.2725308","volume":"5","author":"D Zhang","year":"2017","unstructured":"Zhang, D., Liu, Y., Liu, A., Mao, X., Li, Q.: Efficient path query processing through cloud-based mapping services. IEEE Access 5, 12,963\u201312,973 (2017)","journal-title":"IEEE Access"},{"issue":"1","key":"549_CR41","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10707-016-0288-4","volume":"22","author":"D Zhang","year":"2018","unstructured":"Zhang, D., Chow, C. Y., Liu, A., Zhang, X., Ding, Q., Li, Q.: Efficient evaluation of shortest travel-time path queries through spatial mashups. GeoInformatica 22(1), 3\u201328 (2018)","journal-title":"GeoInformatica"},{"key":"549_CR42","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Zhang, L., Xie, X., Ma, W. Y.: Mining interesting locations and travel sequences from gps trajectories. In: WWW (2009)","DOI":"10.1145\/1526709.1526816"},{"key":"549_CR43","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: SIGMOD (2013)","DOI":"10.1145\/2463676.2465277"},{"key":"549_CR44","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.is.2014.12.005","volume":"49","author":"CJ Zhu","year":"2015","unstructured":"Zhu, C. J., Lam, K. Y., Cheng, R. C., Poon, C. K.: On using broadcast index for efficient execution of shortest path continuous queries. Inf. Syst. 49, 142\u2013162 (2015)","journal-title":"Inf. Syst."},{"issue":"6","key":"549_CR45","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1109\/TNNLS.2016.2521602","volume":"28","author":"X Zhu","year":"2017","unstructured":"Zhu, X., Li, X., Zhang, S., Ju, C., Wu, X.: Robust joint graph sparse coding for unsupervised spectral feature selection. IEEE Trans. Neural Netw. Learn. Syst. 28 (6), 1263\u20131275 (2017)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"9","key":"549_CR46","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1109\/TMM.2017.2703636","volume":"19","author":"X Zhu","year":"2017","unstructured":"Zhu, X., Li, X., Zhang, S., Xu, Z., Yu, L., Wang, C.: Graph pca hashing for similarity search. IEEE Trans. Multimed. 19(9), 2033\u20132044 (2017)","journal-title":"IEEE Trans. Multimed."}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0549-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-018-0549-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0549-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T18:05:46Z","timestamp":1571162746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-018-0549-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,16]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["549"],"URL":"https:\/\/doi.org\/10.1007\/s11280-018-0549-2","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2018,4,16]]},"assertion":[{"value":"2 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}