{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:00:30Z","timestamp":1729627230858,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1109\/asonam.2016.7752238","type":"proceedings-article","created":{"date-parts":[[2016,11,24]],"date-time":"2016-11-24T21:38:35Z","timestamp":1480023515000},"page":"215-222","source":"Crossref","is-referenced-by-count":4,"title":["All-pairs shortest distances maintenance in relational DBMSs"],"prefix":"10.1109","author":[{"given":"Sergio","family":"Greco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Molinaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiara","family":"Pulice","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ximena","family":"Quintana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/2530531"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1007\/s00778-012-0274-x"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/2213836.2213887"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/2463676.2465315"},{"key":"ref14","first-page":"26","article-title":"Computing point-to-point shortest paths from external memory","author":"goldberg","year":"2005","journal-title":"ALENEX\/ANALCO"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/2463676.2465277"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.14778\/2732219.2732225"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/ICDE.2012.53"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1145\/2487575.2487665"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/2213836.2213888"},{"key":"ref28","first-page":"369","article-title":"Experimental analysis of dynamic all pairs shortest path algorithms","author":"demetrescu","year":"2004","journal-title":"SODA"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.14778\/1920841.1920878"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1007\/s13278-015-0276-y"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1093\/bioinformatics\/bti116"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.3509","article-title":"Computing all-pairs shortest paths by leveraging low treewidth","volume":"43","author":"planken","year":"2012","journal-title":"J Artif Intell Res"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1093\/bioinformatics\/btg415"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/1093382.1093384"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1016\/j.jnca.2011.06.001"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.14778\/2140436.2140438"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1007\/BF01386390"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/s13278-014-0220-6"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.14778\/2536336.2536346"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1016\/0020-0190(88)90136-6"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TKDE.2013.43"},{"key":"ref24","first-page":"394","article-title":"Maintaining all-pairs approximate shortest paths under deletion of edges","author":"baswana","year":"2003","journal-title":"SODA"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1145\/1039488.1039492"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1145\/2396761.2396881"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/SFFCS.1999.814580"}],"event":{"name":"2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","start":{"date-parts":[[2016,8,18]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2016,8,21]]}},"container-title":["2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7736513\/7752180\/07752238.pdf?arnumber=7752238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:20:13Z","timestamp":1568589613000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7752238\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/asonam.2016.7752238","relation":{},"subject":[],"published":{"date-parts":[[2016,8]]}}}