{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:39Z","timestamp":1750306359852,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,10,17]],"date-time":"2016-10-17T00:00:00Z","timestamp":1476662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,10,17]]},"DOI":"10.1145\/3007818.3007837","type":"proceedings-article","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T12:34:59Z","timestamp":1490013299000},"page":"43-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SP\n            <sup>2<\/sup>"],"prefix":"10.1145","author":[{"given":"Batjargal","family":"Dolgorsuren","sequence":"first","affiliation":[{"name":"Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Korea"}]},{"given":"Weihua","family":"Xu","sequence":"additional","affiliation":[{"name":"Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Korea"}]},{"given":"Kifayat Ullah","family":"Khan","sequence":"additional","affiliation":[{"name":"Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Korea"}]},{"given":"Byeong-Soo","family":"Jeong","sequence":"additional","affiliation":[{"name":"Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Korea"}]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[{"name":"Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Korea"}]}],"member":"320","published-online":{"date-parts":[[2016,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Shortest paths in microseconds. arXiv preprint arXiv:1309.0874","author":"Agarwal R.","year":"2013","unstructured":"R. Agarwal , M. Caesar , P. Godfrey , and B. Y. Zhao . Shortest paths in microseconds. arXiv preprint arXiv:1309.0874 , 2013 . R. Agarwal, M. Caesar, P. Godfrey, and B. Y. Zhao. Shortest paths in microseconds. arXiv preprint arXiv:1309.0874, 2013."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1738952"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.11.001"},{"key":"e_1_3_2_1_4_1","volume-title":"Fully dynamic algorithms for path problems on directed graphs","author":"Demetrescu C.","year":"2001","unstructured":"C. Demetrescu . Fully dynamic algorithms for path problems on directed graphs . 2001 . C. Demetrescu. Fully dynamic algorithms for path problems on directed graphs. 2001."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837060.2837093"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095694"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611497"},{"key":"e_1_3_2_1_8_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014.  J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627694"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0637-7"}],"event":{"name":"EDB: 2016 International Conference on Emerging Databases","sponsor":["KoDB Korea Database Agency","Nara System Nara System","2e consulting 2e consulting"],"location":"Jeju Republic of Korea","acronym":"EDB"},"container-title":["Proceedings of the Sixth International Conference on Emerging Databases: Technologies, Applications, and Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3007818.3007837","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3007818.3007837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:11Z","timestamp":1750222571000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3007818.3007837"}},"subtitle":["spanner construction for shortest path computation on streaming graph"],"short-title":[],"issued":{"date-parts":[[2016,10,17]]},"references-count":11,"alternative-id":["10.1145\/3007818.3007837","10.1145\/3007818"],"URL":"https:\/\/doi.org\/10.1145\/3007818.3007837","relation":{},"subject":[],"published":{"date-parts":[[2016,10,17]]},"assertion":[{"value":"2016-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}