{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:35Z","timestamp":1750306055218,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,19]],"date-time":"2017-05-19T00:00:00Z","timestamp":1495152000000},"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":[[2017,5,19]]},"DOI":"10.1145\/3078447.3078453","type":"proceedings-article","created":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T12:50:05Z","timestamp":1496667005000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Towards a property graph generator for benchmarking"],"prefix":"10.1145","author":[{"given":"Arnau","family":"Prat-P\u00e9rez","sequence":"first","affiliation":[{"name":"DAMA-UPC, Universitat Polit\u00e8cnica de Catalunya"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joan","family":"Guisado-G\u00e1mez","sequence":"additional","affiliation":[{"name":"DAMA-UPC, Universitat Polit\u00e8cnica de Catalunya"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier Fern\u00e1ndez","family":"Salas","sequence":"additional","affiliation":[{"name":"DAMA-UPC, Universitat Polit\u00e8cnica de Catalunya"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Koupy","sequence":"additional","affiliation":[{"name":"Oracle Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siegfried","family":"Depner","sequence":"additional","affiliation":[{"name":"Oracle Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide Basilio","family":"Bartolini","sequence":"additional","affiliation":[{"name":"Oracle Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Neo4J Graph Database. www.neo4j.com. (????).  Neo4J Graph Database. www.neo4j.com. (????)."},{"key":"e_1_3_2_1_2_1","unstructured":"Oracle Parallel Graph Analytics. http:\/\/www.oracle.com\/technetwork\/oracle-labs\/parallel-graph-analytics. (????).  Oracle Parallel Graph Analytics. http:\/\/www.oracle.com\/technetwork\/oracle-labs\/parallel-graph-analytics. (????)."},{"key":"e_1_3_2_1_3_1","unstructured":"Sparksee Graph Database. www.sparsity-technologies.com. (????).  Sparksee Graph Database. www.sparsity-technologies.com. (????)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367530"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2633993"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04936-6_5"},{"key":"e_1_3_2_1_8_1","volume-title":"R-MAT: A recursive model for graph mining. SDM","author":"Chakrabarti Deepayan","year":"2004","unstructured":"Deepayan Chakrabarti , Yiping Zhan , and Christos Faloutsos . 2004. R-MAT: A recursive model for graph mining. SDM ( 2004 ), 442--446. Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. 2004. R-MAT: A recursive model for graph mining. SDM (2004), 442--446."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_10_1","volume-title":"Darwini: Generating realistic large-scale social graphs. arXiv:1610.00664","author":"Sergey Edunov","year":"2016","unstructured":"Sergey Edunov et al. 2016 . Darwini: Generating realistic large-scale social graphs. arXiv:1610.00664 (2016). Sergey Edunov et al. 2016. Darwini: Generating realistic large-scale social graphs. arXiv:1610.00664 (2016)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.06.005"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007270"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/130914218"},{"key":"e_1_3_2_1_15_1","volume-title":"Community detection algorithms: a comparative analysis. Physical review E 80, 5","author":"Lancichinetti Andrea","year":"2009","unstructured":"Andrea Lancichinetti and Santo Fortunato . 2009. Community detection algorithms: a comparative analysis. Physical review E 80, 5 ( 2009 ), 056117. Andrea Lancichinetti and Santo Fortunato. 2009. Community detection algorithms: a comparative analysis. Physical review E 80, 5 (2009), 056117."},{"key":"e_1_3_2_1_16_1","volume-title":"Benchmark graphs for testing community detection algorithms. Physical review E 78, 4","author":"Lancichinetti Andrea","year":"2008","unstructured":"Andrea Lancichinetti , Santo Fortunato , and Filippo Radicchi . 2008. Benchmark graphs for testing community detection algorithms. Physical review E 78, 4 ( 2008 ), 046110. Andrea Lancichinetti, Santo Fortunato, and Filippo Radicchi. 2008. Benchmark graphs for testing community detection algorithms. Physical review E 78, 4 (2008), 046110."},{"key":"e_1_3_2_1_17_1","volume-title":"Birds of a feather: Homophily in social networks. Annual review of sociology 27, 1","author":"McPherson Miller","year":"2001","unstructured":"Miller McPherson , Lynn Smith-Lovin , and James M Cook . 2001. Birds of a feather: Homophily in social networks. Annual review of sociology 27, 1 ( 2001 ), 415--444. Miller McPherson, Lynn Smith-Lovin, and James M Cook. 2001. Birds of a feather: Homophily in social networks. Annual review of sociology 27, 1 (2001), 415--444."},{"key":"e_1_3_2_1_18_1","unstructured":"Richard C Murphy etal 2010. Introducing the graph 500. Cray Users Group (CUG) (2010).  Richard C Murphy et al. 2010. Introducing the graph 500. Cray Users Group (CUG) (2010)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2621934.2621942"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Arnau Prat-P\u00e9rez etal 2011. Social based layouts for the increase of locality in graph operations. DASFAA (2011) 558--569.   Arnau Prat-P\u00e9rez et al. 2011. Social based layouts for the increase of locality in graph operations. DASFAA (2011) 558--569.","DOI":"10.1007\/978-3-642-20149-3_40"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809983"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915220"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2618243.2618272"}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Chicago IL USA","acronym":"SIGMOD\/PODS'17"},"container-title":["Proceedings of the Fifth International Workshop on Graph Data-management Experiences &amp; Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3078447.3078453","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3078447.3078453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:33Z","timestamp":1750215813000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3078447.3078453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,19]]},"references-count":24,"alternative-id":["10.1145\/3078447.3078453","10.1145\/3078447"],"URL":"https:\/\/doi.org\/10.1145\/3078447.3078453","relation":{},"subject":[],"published":{"date-parts":[[2017,5,19]]},"assertion":[{"value":"2017-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}