{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:38:09Z","timestamp":1778279889525,"version":"3.51.4"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2014,5,13]],"date-time":"2014-05-13T00:00:00Z","timestamp":1399939200000},"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":["SIGMOD Rec."],"published-print":{"date-parts":[[2014,5,13]]},"abstract":"<jats:p>The Linked Data Benchmark Council (LDBC) is an EU project that aims to develop industry-strength benchmarks for graph and RDF data management systems. It includes the creation of a non-profit LDBC organization, where industry players and academia come together for managing the development of benchmarks as well as auditing and publishing official results. We present an overview of the project including its goals and organization, and describe its process and design methodology for benchmark development. We introduce so-called \"choke-point\" based benchmark development through which experts identify key technical challenges, and introduce them in the benchmark workload. Finally, we present the status of two benchmarks currently in development, one targeting graph data management systems using a social network data case, and the other targeting RDF systems using a data publishing case.<\/jats:p>","DOI":"10.1145\/2627692.2627697","type":"journal-article","created":{"date-parts":[[2014,5,27]],"date-time":"2014-05-27T12:56:59Z","timestamp":1401195419000},"page":"27-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":60,"title":["The linked data benchmark council"],"prefix":"10.1145","volume":"43","author":[{"given":"Renzo","family":"Angles","sequence":"first","affiliation":[{"name":"Universidad de Talca, Chile and VU University Amsterdam, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Boncz","sequence":"additional","affiliation":[{"name":"CWI, Amsterdam, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep","family":"Larriba-Pey","sequence":"additional","affiliation":[{"name":"Universitat Polit\u00e8cnica de Catalunya, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irini","family":"Fundulaki","sequence":"additional","affiliation":[{"name":"FORTH, Heraklion, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Neumann","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orri","family":"Erling","sequence":"additional","affiliation":[{"name":"OpenLink Software, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Neubauer","sequence":"additional","affiliation":[{"name":"Neo Technology, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbert","family":"Martinez-Bazan","sequence":"additional","affiliation":[{"name":"Sparsity Technologies, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venelin","family":"Kotsev","sequence":"additional","affiliation":[{"name":"Ontotext AD, Bulgaria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioan","family":"Toma","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Innsbruck, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5,13]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"TPCTC","author":"Boncz P.","year":"2013","unstructured":"P. Boncz , T. Neumann , and O. Erling . TPC-H Analyzed: Hidden Messages and Lessons Learned from an Influential Benchmark . In TPCTC , 2013 . P. Boncz, T. Neumann, and O. Erling. TPC-H Analyzed: Hidden Messages and Lessons Learned from an Influential Benchmark. In TPCTC, 2013."},{"key":"e_1_2_1_2_1","volume-title":"TPCTC","author":"Dominguez-Sal D.","year":"2010","unstructured":"D. Dominguez-Sal , N. Martinez-Bazan , V. Muntes-Mulero , P. Baleta , and J. L. Larriba-Pey . A Discussion on the Design of Graph Database Benchmarks . In TPCTC , 2010 . D. Dominguez-Sal, N. Martinez-Bazan, V. Muntes-Mulero, P. Baleta, and J. L. Larriba-Pey. A Discussion on the Design of Graph Database Benchmarks. In TPCTC, 2010."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989340"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.19"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10424-4_3"},{"key":"e_1_2_1_6_1","volume-title":"TPCTC","author":"Pham M.-D.","year":"2012","unstructured":"M.-D. Pham , P. A. Boncz , and O. Erling . S3G2: A Scalable Structure-Correlated Social Graph Generator . In TPCTC , 2012 . M.-D. Pham, P. A. Boncz, and O. Erling. S3G2: A Scalable Structure-Correlated Social Graph Generator. In TPCTC, 2012."},{"key":"e_1_2_1_7_1","volume-title":"SSWS","author":"Weith\u00f6ner T.","year":"2006","unstructured":"T. Weith\u00f6ner , T. Liebig , M. Luther , and S. B\u00f6hm . What's Wrong with OWL Benchmarks . In SSWS , 2006 . T. Weith\u00f6ner, T. Liebig, M. Luther, and S. B\u00f6hm. What's Wrong with OWL Benchmarks. In SSWS, 2006."}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2627692.2627697","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2627692.2627697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:36Z","timestamp":1750230096000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2627692.2627697"}},"subtitle":["a graph and RDF industry benchmarking effort"],"short-title":[],"issued":{"date-parts":[[2014,5,13]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,5,13]]}},"alternative-id":["10.1145\/2627692.2627697"],"URL":"https:\/\/doi.org\/10.1145\/2627692.2627697","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2014,5,13]]},"assertion":[{"value":"2014-05-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}