{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:54Z","timestamp":1750307094103,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T00:00:00Z","timestamp":1351468800000},"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":[[2012,10,29]]},"DOI":"10.1145\/2396761.2396881","type":"proceedings-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T16:38:00Z","timestamp":1352997480000},"page":"952-961","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs"],"prefix":"10.1145","author":[{"given":"Tom","family":"Crecelius","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbruecken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Schenkel","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbruecken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509928"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02279-1_29"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.117"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646109"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516417"},{"key":"e_1_3_2_1_6_1","first-page":"937","volume-title":"SODA","author":"Cohen E.","year":"2002","unstructured":"E. Cohen , E. Halperin , H. Kaplan , and U. Zwick . Reachability and distance queries via 2-hop labels . In SODA , pages 937 -- 946 , 2002 . E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937--946, 2002."},{"key":"e_1_3_2_1_7_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms , Third Edition. The MIT Press and McGraw-Hill Book Company , 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Third Edition. The MIT Press and McGraw-Hill Book Company, 2009."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039492"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1198513.1198519"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_11_1","first-page":"1","article-title":"Maintaining transitive closure of graphs","volume":"5","author":"Dong G.","year":"1999","unstructured":"G. Dong , L. Libkin , J. Su , and L. Wong . Maintaining transitive closure of graphs in SQL. Int. Journal on Information Technology , 5 : 1 -- 23 , 1999 . G. Dong, L. Libkin, J. Su, and L. Wong. Maintaining transitive closure of graphs in SQL. Int. Journal on Information Technology, 5:1--23, 1999.","journal-title":"Journal on Information Technology"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00082-8"},{"key":"e_1_3_2_1_13_1","first-page":"529","volume-title":"VLDB","author":"Graupmann J.","year":"2005","unstructured":"J. Graupmann , R. Schenkel , and G. Weikum . The SphereSearch engine for unified ranked retrieval of heterogeneous XML and web documents . In VLDB , pages 529 -- 540 , 2005 . J. Graupmann, R. Schenkel, and G. Weikum. The SphereSearch engine for unified ranked retrieval of heterogeneous XML and web documents. In VLDB, pages 529--540, 2005."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497504"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796487"},{"key":"e_1_3_2_1_19_1","first-page":"268","volume-title":"COCOON","author":"King V.","year":"2001","unstructured":"V. King and M. Thorup . A space saving trick for directed dynamic transitive closure and shortest path algorithms . In COCOON , pages 268 -- 277 , 2001 . V. King and M. Thorup. A space saving trick for directed dynamic transitive closure and shortest path algorithms. In COCOON, pages 268--277, 2001."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_21_1","unstructured":"U.\n      Meyer\n    .\n  On dynamic breadth-first search in external-memory\n  . In S. Albers and P. Weil editors STACS volume \n  1\n   of \n  LIPIcs pages \n  551\n  --\n  560\n  . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik Germany 2008\n  .  U. Meyer. On dynamic breadth-first search in external-memory. In S. Albers and P. Weil editors STACS volume 1 of LIPIcs pages 551--560. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik Germany 2008."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1093382.1093384"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0046"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390424"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.57"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247573"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772790"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516418"}],"event":{"name":"CIKM'12: 21st ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Maui Hawaii USA","acronym":"CIKM'12"},"container-title":["Proceedings of the 21st ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396881","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2396761.2396881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:39Z","timestamp":1750239279000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,29]]},"references-count":28,"alternative-id":["10.1145\/2396761.2396881","10.1145\/2396761"],"URL":"https:\/\/doi.org\/10.1145\/2396761.2396881","relation":{},"subject":[],"published":{"date-parts":[[2012,10,29]]},"assertion":[{"value":"2012-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}