{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:23:02Z","timestamp":1755998582968,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,10]],"date-time":"2018-06-10T00:00:00Z","timestamp":1528588800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100007626","name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","doi-asserted-by":"publisher","award":["LP2015-12"],"award-info":[{"award-number":["LP2015-12"]}],"id":[{"id":"10.13039\/100007626","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,10]]},"DOI":"10.1145\/3210259.3210268","type":"proceedings-article","created":{"date-parts":[[2018,6,5]],"date-time":"2018-06-05T17:54:00Z","timestamp":1528221240000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["An early look at the LDBC social network benchmark's business intelligence workload"],"prefix":"10.1145","author":[{"given":"G\u00e1bor","family":"Sz\u00e1rnyas","sequence":"first","affiliation":[{"name":"MTA-BME Lend\u00fclet Cyber-Physical Systems Research Group and Budapest University of Technology and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnau","family":"Prat-P\u00e9rez","sequence":"additional","affiliation":[{"name":"Sparsity Technologies and DAMA UPC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Averbuch","sequence":"additional","affiliation":[{"name":"Neo4j"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f3zsef","family":"Marton","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Paradies","sequence":"additional","affiliation":[{"name":"DLR and SAP SE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"Kaufmann","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orri","family":"Erling","sequence":"additional","affiliation":[{"name":"OpenLink Software"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Boncz","sequence":"additional","affiliation":[{"name":"CWI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vlad","family":"Haprian","sequence":"additional","affiliation":[{"name":"Oracle Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1nos Benjamin","family":"Antal","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"G\u00fcnes Alu\u00e7 Olaf Hartig M. Tamer \u00d6zsu and Khuzaima Daudjee. 2014. Diversified Stress Testing of RDF Data Management Systems. In ISWC. 197--212. 10.1007\/978-3-319-11964-9_13","DOI":"10.1007\/978-3-319-11964-9_13"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Renzo Angles and others. 2018. G-CORE: A Core for Future Graph Query Languages. In SIGMOD. 10.1145\/3183713.3190654","DOI":"10.1145\/3183713.3190654"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3104031"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"Timothy G. Armstrong Vamsi Ponnekanti Dhruba Borthakur and Mark Callaghan. 2013. LinkBench: a database benchmark based on the Facebook social graph. In SIGMOD. 1185--1196. 10.1145\/2463676.2465296","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602569_48"},{"key":"e_1_3_2_1_6_1","volume-title":"BG: A Benchmark to Evaluate Interactive Social Networking Actions. In CIDR","author":"Barahmand Sumita","year":"2013","unstructured":"Sumita Barahmand and Shahram Ghandeharizadeh. 2013. BG: A Benchmark to Evaluate Interactive Social Networking Actions. In CIDR. http:\/\/cidrdb.org\/cidr2013\/Papers\/CIDR13_Paper93.pdf"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/702694"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4018\/jswis.2009081901"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"Peter A. Boncz Thomas Neumann and Orri Erling. 2013. TPC-H Analyzed: Hidden Messages and Lessons Learned from an Influential Benchmark. In TPCTC. 61--76. 10.1007\/978-3-319-04936-6_5","DOI":"10.1007\/978-3-319-04936-6_5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"Donko Donjerkovic and Raghu Ramakrishnan. 1999. Probabilistic Optimization of Top N Queries. In VLDB. 411--422. http:\/\/www.vldb.org\/conf\/1999\/P40.pdf","DOI":"10.5555\/645925.671510"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Benedikt Elser and Alberto Montresor. 2013. An evaluation study of BigData frameworks for graph processing. In Big Data. 60--67.","DOI":"10.1109\/BigData.2013.6691555"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Orri Erling and others. 2015. The LDBC Social Network Benchmark: Interactive Workload. In SIGMOD. 619--630. 10.1145\/2723372.2742786","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/5666.5673"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190657"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009726021843"},{"key":"e_1_3_2_1_16_1","volume-title":"Boncz","author":"Gubichev Andrey","year":"2014","unstructured":"Andrey Gubichev and Peter A. Boncz. 2014. Parameter Curation for Benchmark Queries. In TPCTC (Lecture Notes in Computer Science), Vol. 8904. Springer, 113--129."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.06.005"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2379538.2379542"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007270"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2011.5767616"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/359414"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","unstructured":"Mohamed Morsey Jens Lehmann S\u00f6ren Auer and Axel-Cyrille Ngonga Ngomo. 2011. DBpedia SPARQL Benchmark - Performance Assessment with Real Queries on Real Data. In ISWC. 454--469.","DOI":"10.5555\/2063016.2063046"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807626"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","unstructured":"Raghunath Othayoth Nambiar and Meikel P\u00f6ss. 2006. The Making of TPC-DS. In VLDB. 1049--1058. http:\/\/dl.acm.org\/citation.cfm?id=1164217","DOI":"10.5555\/1182635.1164217"},{"key":"e_1_3_2_1_25_1","unstructured":"Thomas Neumann and Guido Moerkotte. 2009. A Framework for Reasoning about Share Equivalence and Its Integration into a Plan Generator. In BTW. 7--26. http:\/\/subs.emis.de\/LNI\/Proceedings\/Proceedings144\/article5220.html"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1567274.1567278"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/369275.369291"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","unstructured":"Arnau Prat-P\u00e9rez and David Dom\u00ednguez-Sal. 2014. How community-like is the structure of synthetically generated graphs?. In GRADES at SIGMOD. 7:1--7:9. 10.1145\/2621934.2621942","DOI":"10.1145\/2621934.2621942"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","unstructured":"Sherif Sakr Sameh Elnikety and Yuxiong He. 2012. G-SPARQL: a hybrid engine for querying large attributed graphs. In CIKM. 335--344. 10.1145\/2396761.2396806","DOI":"10.1145\/2396761.2396806"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","unstructured":"Michael Schmidt Thomas Hornung Michael Meier Christoph Pinkel and Georg Lausen. 2009. SP2Bench: A SPARQL Performance Benchmark. In Semantic Web Information Management - A Model-Based Perspective. 371--393. 10.1109\/ICDE.2009.28","DOI":"10.1109\/ICDE.2009.28"},{"key":"e_1_3_2_1_31_1","first-page":"18","article-title":"Trinity Graph Engine and its Applications","volume":"40","author":"Shao Bin","year":"2017","unstructured":"Bin Shao, Yatao Li, Haixun Wang, and Huanhuan Xia. 2017. Trinity Graph Engine and its Applications. IEEE Data Eng. Bull. 40, 3 (2017), 18--29. http:\/\/sites.computer.org\/debull\/A17sept\/p18.pdf","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"G\u00e1bor Sz\u00e1rnyas Benedek Izs\u00f3 Istv\u00e1n R\u00e1th and D\u00e1niel Varr\u00f3. 2017. The Train Benchmark: cross-technology performance evaluation of continuous model queries. Softw. Syst. Model. (2017).","DOI":"10.1007\/s10270-016-0571-8"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","unstructured":"Oskar van Rest Sungpack Hong Jinha Kim Xuming Meng and Hassan Chafi. 2016. PGQL: a property graph query language. In GRADES at SIGMOD. 10.1145\/2960414.2960421","DOI":"10.1145\/2960414.2960421"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0256-4"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Houston Texas","acronym":"SIGMOD\/PODS '18"},"container-title":["Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210259.3210268","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210259.3210268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:49Z","timestamp":1750210789000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210259.3210268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,10]]},"references-count":34,"alternative-id":["10.1145\/3210259.3210268","10.1145\/3210259"],"URL":"https:\/\/doi.org\/10.1145\/3210259.3210268","relation":{},"subject":[],"published":{"date-parts":[[2018,6,10]]},"assertion":[{"value":"2018-06-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}