TY - GEN
T1 - List.MID: A MIDI-Based Benchmark for Evaluating RDF Lists
AU - Meroño-Peñuela, Albert
AU - Daga, Enrico
PY - 2019
Y1 - 2019
N2 - Linked lists represent a countable number of ordered values, and are among the most important abstract data types in computer science. With the advent of RDF as a highly expressive knowledge representation language for the Web, various implementations for RDF lists have been proposed. Yet, there is no benchmark so far dedicated to evaluate the performance of triple stores and SPARQL query engines on dealing with ordered linked data. Moreover, essential tasks for evaluating RDF lists, like generating datasets containing RDF lists of various sizes, or generating the same RDF list using different modelling choices, are cumbersome and unprincipled. In this paper, we propose List.MID, a systematic benchmark for evaluating systems serving RDF lists. List.MID consists of a dataset generator, which creates RDF list data in various models and of different sizes; and a set of SPARQL queries. The RDF list data is coherently generated from a large, community-curated base collection of Web MIDI files, rich in lists of musical events of arbitrary length. We describe the List.MID benchmark, and discuss its impact and adoption, reusability, design, and availability.
AB - Linked lists represent a countable number of ordered values, and are among the most important abstract data types in computer science. With the advent of RDF as a highly expressive knowledge representation language for the Web, various implementations for RDF lists have been proposed. Yet, there is no benchmark so far dedicated to evaluate the performance of triple stores and SPARQL query engines on dealing with ordered linked data. Moreover, essential tasks for evaluating RDF lists, like generating datasets containing RDF lists of various sizes, or generating the same RDF list using different modelling choices, are cumbersome and unprincipled. In this paper, we propose List.MID, a systematic benchmark for evaluating systems serving RDF lists. List.MID consists of a dataset generator, which creates RDF list data in various models and of different sizes; and a set of SPARQL queries. The RDF list data is coherently generated from a large, community-curated base collection of Web MIDI files, rich in lists of musical events of arbitrary length. We describe the List.MID benchmark, and discuss its impact and adoption, reusability, design, and availability.
KW - Benchmarks
KW - Linked lists
KW - RDF
UR - http://www.scopus.com/inward/record.url?scp=85081079901&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85081079901&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-30796-7_16
DO - 10.1007/978-3-030-30796-7_16
M3 - Conference contribution
AN - SCOPUS:85081079901
SN - 9783030307950
VL - 2
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 246
EP - 260
BT - The Semantic Web – ISWC 2019
A2 - Ghidini, Chiara
A2 - Hartig, Olaf
A2 - Maleshkova, Maria
A2 - Svátek, Vojtech
A2 - Cruz, Isabel
A2 - Hogan, Aidan
A2 - Song, Jie
A2 - Lefrançois, Maxime
A2 - Gandon, Fabien
PB - Springer
T2 - 18th International Semantic Web Conference, ISWC 2019
Y2 - 26 October 2019 through 30 October 2019
ER -