{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:02:16Z","timestamp":1765544536942,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,4,7]],"date-time":"2014-04-07T00:00:00Z","timestamp":1396828800000},"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":[[2014,4,7]]},"DOI":"10.1145\/2567948.2580051","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T19:44:31Z","timestamp":1454701471000},"page":"1321-1326","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Towards large-scale graph stream processing platform"],"prefix":"10.1145","author":[{"given":"Toyotaro","family":"Suzumura","sequence":"first","affiliation":[{"name":"IBM Research \/ JST CREST, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunsuke","family":"Nishii","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaru","family":"Ganse","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,4,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376729"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_4_1","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat , \" MapReduce: Simplified data processing on large clusters \", OSDI , 2004 . J. Dean and S. Ghemawat, \"MapReduce: Simplified data processing on large clusters\", OSDI, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062885"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2003.12.008"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Frigioni Daniele and Marchetti-Spaccamela Alberto and Nanni Umberto \"Incremental algorithms for the single-source shortest path problem\" Foundation of Software Technology and Theoretical Computer Science (1994) 113--124   Frigioni Daniele and Marchetti-Spaccamela Alberto and Nanni Umberto \"Incremental algorithms for the single-source shortest path problem\" Foundation of Software Technology and Theoretical Computer Science (1994) 113--124","DOI":"10.1007\/3-540-58715-2_118"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.605773"},{"key":"e_1_3_2_1_10_1","series-title":"LNCS(2001) 232--246","volume-title":"9th GD.","author":"Stephen","unstructured":"Stephen C. North and Gordon Woodhull \"Online hierarchical graph drawing\" In: Proc . 9th GD. Vol. 2265 of LNCS(2001) 232--246 Stephen C. North and Gordon Woodhull \"Online hierarchical graph drawing\" In: Proc. 9th GD. Vol. 2265 of LNCS(2001) 232--246"},{"volume-title":"AMCIS 2008","author":"Barth Anja","key":"e_1_3_2_1_11_1","unstructured":"Falkowski, Tanja, Anja Barth , and Myra Spiliopoulou ,\" Studying Community Dynamics with an Incremental Graph Mining Algorithm \", AMCIS 2008 Falkowski, Tanja, Anja Barth, and Myra Spiliopoulou,\" Studying Community Dynamics with an Incremental Graph Mining Algorithm\", AMCIS 2008"},{"key":"e_1_3_2_1_12_1","series-title":"SIAM Data Mining","volume-title":"R-MAT: A recursive model for graph mining","author":"Chakrabarti D.","year":"2004","unstructured":"D. Chakrabarti , Y. Zhan , and C. Faloutsos , R-MAT: A recursive model for graph mining , SIAM Data Mining 2004 . D. Chakrabarti, Y. Zhan, and C. Faloutsos, R-MAT: A recursive model for graph mining, SIAM Data Mining 2004."}],"event":{"name":"WWW '14: 23rd International World Wide Web Conference","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Seoul Korea","acronym":"WWW '14"},"container-title":["Proceedings of the 23rd International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567948.2580051","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2567948.2580051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:31Z","timestamp":1750234231000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567948.2580051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,7]]},"references-count":12,"alternative-id":["10.1145\/2567948.2580051","10.1145\/2567948"],"URL":"https:\/\/doi.org\/10.1145\/2567948.2580051","relation":{},"subject":[],"published":{"date-parts":[[2014,4,7]]},"assertion":[{"value":"2014-04-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}