{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:34:06Z","timestamp":1725798846380},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319111155"},{"type":"electronic","value":"9783319111162"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11116-2_29","type":"book-chapter","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T21:04:18Z","timestamp":1408050258000},"page":"331-342","source":"Crossref","is-referenced-by-count":1,"title":["Refreshment Strategies for the Shortest Path Caching Problem with Changing Edge Weight"],"prefix":"10.1007","author":[{"given":"Xiaohua","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"29_CR1","doi-asserted-by":"publisher","first-page":"406","DOI":"10.14778\/2140436.2140438","volume":"5","author":"L. Wu","year":"2012","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. Proceedings of the VLDB Endowment\u00a05(5), 406\u2013417 (2012)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Long, X., Suel, T.: Three-level caching for efficient query processing in large web search engines. In: World Wide Web Conference, WWW, pp. 257\u2013266 (2005)","DOI":"10.1145\/1060745.1060785"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM, pp. 867\u2013876 (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Wei, F.: Tedi: Efficient shortest path query answering on graphs. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 99\u2013110. ACM (2010)","DOI":"10.1145\/1807167.1807181"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-23535-1_12","volume-title":"Web-Age Information Management","author":"X. Liu","year":"2011","unstructured":"Liu, X., Yang, X.: A generalization based approach for anonymizing weighted social network graphs. In: Wang, H., Li, S., Oyama, S., Hu, X., Qian, T. (eds.) WAIM 2011. LNCS, vol.\u00a06897, pp. 118\u2013130. Springer, Heidelberg (2011)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., Cheng, C.: Efficient processing of distance queries in large graphs: A vertex cover approach. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 457\u2013468. ACM (2012)","DOI":"10.1145\/2213836.2213888"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-642-00958-7_59","volume-title":"Advances in Information Retrieval","author":"I.S. Altingovde","year":"2009","unstructured":"Altingovde, I.S., Ozcan, R., Ulusoy, \u00d6.: A cost-aware strategy for query result caching in web search engines. In: Boughanem, M., Berrut, C., Mothe, J., Soule-Dupuy, C. (eds.) ECIR 2009. LNCS, vol.\u00a05478, pp. 628\u2013636. Springer, Heidelberg (2009)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R., Gionis, A., Junqueira, F., Murdock, V., Plachouras, V., Silvestri, F.: The impact of caching on search engines. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 183\u2013190. ACM (2007)","DOI":"10.1145\/1277741.1277775"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Kroger, P., Renz, M., Schmidt, T.: Hierarchical graph embedding for efficient query processing in very large traffic networks. In: Scientific and Statistical Database Management Conference, SSDBM, pp. 150\u2013167 (2008)","DOI":"10.1007\/978-3-540-69497-7_12"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Gan, Q., Suel, T.: Improved techniques for result caching in web search engines. In: Proceedings of the 18th International Conference on World Wide Web, pp. 431\u2013440. ACM (2009)","DOI":"10.1145\/1526709.1526768"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0140-3664(00)00308-X","volume":"24","author":"E.P. Markatos","year":"2001","unstructured":"Markatos, E.P.: On caching search engine query results. Computer Communications\u00a024(2), 137\u2013143 (2001)","journal-title":"Computer Communications"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Thomsen, J.R., Yiu, M.L., Jensen, C.S.: Effective caching of shortest paths for location-based services. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 313\u2013324. ACM (2012)","DOI":"10.1145\/2213836.2213872"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Li, X., Wang, S., Yang, X., Wang, B., Ge, Y.: An improved algorithm to enhance the utilization of shortest path caches. In: Web Information System and Application, pp. 419\u2013424. IEEE (2013)","DOI":"10.1109\/WISA.2013.85"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-73540-3_2","volume-title":"Advances in Spatial and Temporal Databases","author":"C.-C. Lee","year":"2007","unstructured":"Lee, C.-C., Wu, Y.-H., Chen, A.L.P.: Continuous evaluation of fastest path queries on road networks. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol.\u00a04605, pp. 20\u201337. Springer, Heidelberg (2007)"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Tian, Y., Lee, K.C.K, Lee, W.-C.: Monitoring minimum cost paths on road networks. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 217\u2013226. ACM (2009)","DOI":"10.1145\/1653771.1653803"},{"key":"29_CR16","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., et al.: Introduction to Algorithms, vol.\u00a02. MIT Press, Cambridge (2001)"}],"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-11116-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:25:20Z","timestamp":1558974320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11116-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319111155","9783319111162"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11116-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}