{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:56Z","timestamp":1773481856468,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,23]],"date-time":"2013-06-23T00:00:00Z","timestamp":1371945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002809","name":"Generalitat de Catalunya","doi-asserted-by":"publisher","award":["TIN2009-14560-C03-03, GRC-1187"],"award-info":[{"award-number":["TIN2009-14560-C03-03, GRC-1187"]}],"id":[{"id":"10.13039\/501100002809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["Torres Quevedo PTQ-11-04970"],"award-info":[{"award-number":["Torres Quevedo PTQ-11-04970"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["11100364"],"award-info":[{"award-number":["11100364"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,23]]},"DOI":"10.1145\/2484425.2484440","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Benchmarking database systems for social network applications"],"prefix":"10.1145","author":[{"given":"Renzo","family":"Angles","sequence":"first","affiliation":[{"name":"Universidad de Talca, VU University, Amsterdam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnau","family":"Prat-P\u00e9rez","sequence":"additional","affiliation":[{"name":"DAMA-UPC, Universitat Polit\u00e8cnica de Catalunya"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Dominguez-Sal","sequence":"additional","affiliation":[{"name":"Sparsity Technologies"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep-Lluis","family":"Larriba-Pey","sequence":"additional","affiliation":[{"name":"DAMA-UPC, Universitat Polit\u00e8cnica de Catalunya"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2012.31"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_3_2_1_3_1","volume-title":"Workshop on Graph Theoretical Concepts in Computer Science","author":"Biskup J.","year":"1988","unstructured":"J. Biskup and H. Stiefeling . Transitive closure algorithms for very large databases . In Workshop on Graph Theoretical Concepts in Computer Science , 1988 . J. Biskup and H. Stiefeling. Transitive closure algorithms for very large databases. In Workshop on Graph Theoretical Concepts in Computer Science, 1988."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/971697.602283"},{"key":"e_1_3_2_1_5_1","volume-title":"ICDM","author":"Chakrabarti D.","year":"2004","unstructured":"D. Chakrabarti , Y. Zhan , and C.s Faloutsos. R-mat : A recursive model for graph mining . In ICDM , 2004 . D. Chakrabarti, Y. Zhan, and C.s Faloutsos. R-mat: A recursive model for graph mining. In ICDM, 2004."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1927585.1927590"},{"key":"e_1_3_2_1_7_1","volume-title":"Annual report 2012 (10k)","year":"2013","unstructured":"Facebook. Annual report 2012 (10k) . 1 Feb. 2013 . Facebook. Annual report 2012 (10k). 1 Feb. 2013."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0165-y"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298576"}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","location":"New York New York","acronym":"SIGMOD\/PODS'13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["First International Workshop on Graph Data Management Experiences and Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484425.2484440","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2484425.2484440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484425.2484440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,23]]},"references-count":10,"alternative-id":["10.1145\/2484425.2484440","10.1145\/2484425"],"URL":"https:\/\/doi.org\/10.1145\/2484425.2484440","relation":{},"subject":[],"published":{"date-parts":[[2013,6,23]]},"assertion":[{"value":"2013-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}