{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:39:59Z","timestamp":1726065599116},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030394684"},{"type":"electronic","value":"9783030394691"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39469-1_9","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T12:03:01Z","timestamp":1579608181000},"page":"105-120","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Typical Snapshots Selection for Shortest Path Query in Dynamic Road Networks"],"prefix":"10.1007","author":[{"given":"Mengxuan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Hua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,21]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-12079-5_1","volume-title":"Databases Theory and Applications","author":"M Zhang","year":"2019","unstructured":"Zhang, M., Li, L., Hua, W., Zhou, X.: Batch processing of shortest path queries in road networks. In: Chang, L., Gan, J., Cao, X. (eds.) ADC 2019. LNCS, vol. 11393, pp. 3\u201316. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12079-5_1"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Zhou, X.: Efficient batch processing of shortest path queries in road networks. In: 2019 20th IEEE International Conference on Mobile Data Management (MDM), pp. 100\u2013105. IEEE (2019)","DOI":"10.1109\/MDM.2019.00-69"},{"key":"9_CR3","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":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319\u2013333. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68552-4_24"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Ouyang, D., Qin, L., Chang, L., Lin, X., Zhang, Y., Zhu, Q.: When hierarchy meets 2-Hop-labeling: efficient shortest distance queries on road networks. In: Proceedings of the 2018 International Conference on Management of Data, pp. 709\u2013724. ACM (2018)","DOI":"10.1145\/3183713.3196913"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 43\u201354. ACM (2008)","DOI":"10.1145\/1376616.1376623"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.14778\/3015274.3015277","volume":"10","author":"S Wang","year":"2016","unstructured":"Wang, S., Xiao, X., Yang, Y., Lin, W.: Effective indexing for approximate constrained shortest path queries on large road networks. Proc. VLDB Endow. 10(2), 61\u201372 (2016)","journal-title":"Proc. VLDB Endow."},{"issue":"11","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.14778\/3137628.3137638","volume":"10","author":"L Li","year":"2017","unstructured":"Li, L., Hua, W., Du, X., Zhou, X.: Minimal on-road time route scheduling on time-dependent graphs. Proc. VLDB Endow. 10(11), 1274\u20131285 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-dependent contraction hierarchies. In: Proceedings of the Meeting on Algorithm Engineering & Expermiments. Society for Industrial and Applied Mathematics, pp. 97\u2013105 (2009)","DOI":"10.1137\/1.9781611972894.10"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Li, L., Wang, S., Zhou, X.: Time-dependent hop labeling on road network. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 902\u2013913, April 2019","DOI":"10.1109\/ICDE.2019.00085"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Zhao, X., Xiao, C., Lin, X., Wang, W.: Efficient graph similarity joins with edit distance constraints. In: 2012 IEEE 28th International Conference on Data Engineering, pp. 834\u2013845. IEEE (2012)","DOI":"10.1109\/ICDE.2012.91"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Gouda, K., Hassaan, M.: CSI_GED: an efficient approach for graph edit similarity computation. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 265\u2013276. IEEE (2016)","DOI":"10.1109\/ICDE.2016.7498246"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Li, Z., Jian, X., Lian, X., Chen, L.: An efficient probabilistic approach for graph similarity search. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 533\u2013544. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00055"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Chen, L., Gao, Y., Zhang, Y., Jensen, C.S., Zheng, B.: Efficient and incremental clustering algorithms on star-schema heterogeneous graphs. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 256\u2013267. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00031"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00778-018-0499-4","volume":"27","author":"L Li","year":"2018","unstructured":"Li, L., Zheng, K., Wang, S., Hua, W., Zhou, X.: Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory. VLDB J.- Int. J. Very Large Data Bases 27(3), 321\u2013345 (2018)","journal-title":"VLDB J.- Int. J. Very Large Data Bases"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/3231541.3231545","volume":"10","author":"L Li","year":"2018","unstructured":"Li, L., Kim, J., Xu, J., Zhou, X.: Time-dependent route scheduling on road networks. SIGSPATIAL Spec. 10(1), 10\u201314 (2018)","journal-title":"SIGSPATIAL Spec."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-13193-6_15","volume-title":"Experimental Algorithms","author":"GV Batz","year":"2010","unstructured":"Batz, G.V., Geisberger, R., Neubauer, S., Sanders, P.: Time-dependent contraction hierarchies and approximation. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 166\u2013177. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13193-6_15"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Li, L., Zhang, M., Hua, W., Zhou, X.: Fast query decomposition for batch shortest path processing in road networks. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE)","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data. ACM, pp. 766\u2013777 (2005)","DOI":"10.1145\/1066157.1066244"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. Proc. VLDB Endow. 2(1), 718\u2013729 (2009)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"9_CR21","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/TKDE.2010.28","volume":"24","author":"G Wang","year":"2010","unstructured":"Wang, G., Wang, B., Yang, X., Yu, G.: Efficiently indexing large sparse graphs for similarity search. IEEE Trans. Knowl. Data Eng. 24(3), 440\u2013451 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"34","key":"9_CR22","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96(34), 226\u2013231 (1996)","journal-title":"Kdd"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Gan, J., Tao, Y.: DBSCAN revisited: mis-claim, un-fixability, and approximation. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 519\u2013530. ACM (2015)","DOI":"10.1145\/2723372.2737792"},{"issue":"4","key":"9_CR24","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1093\/comjnl\/20.4.364","volume":"20","author":"D Defays","year":"1977","unstructured":"Defays, D.: An efficient algorithm for a complete link method. Comput. J. 20(4), 364\u2013366 (1977)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39469-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T03:18:47Z","timestamp":1614050327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39469-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030394684","9783030394691"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39469-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc2020.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}