Modelling and querying lists in RDF: A pragmatic study

Enrico Daga, Albert Meroño Peñuela, Enrico Motta

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

Many Linked Data datasets model elements in their domains in the form of lists: a countable number of ordered resources. When publishing these lists in RDF, an important concern is making them easy to consume. Therefore, a well-known recommendation is to find an existing list modelling solution, and reuse it. However, a specific domain model can be implemented in different ways and vocabularies may provide alternative solutions. In this paper, we argue that a wrong decision could have a significant impact in terms of performance and, ultimately, the availability of the data. We take the case of RDF Lists and make the hypothesis that the efficiency of retrieving sequential linked data depends primarily on how they are modelled (triple-store invariance hypothesis). To demonstrate this, we survey different solutions for modelling sequences in RDF, and propose a pragmatic approach for assessing their impact on data availability. Finally, we derive good (and bad) practices on how to publish lists as linked open data. By doing this, we sketch the foundations of an empirical, task-oriented methodology for benchmarking linked data modelling solutions.

Original languageEnglish
Title of host publicationQuWeDa 2019
Subtitle of host publicationProceedings of the QuWeDa 2019: 3rd Workshop on Querying and Benchmarking the Web of Data co-located with 18th International Semantic Web Conference (ISWC 2019) Auckland, New Zealand, October 26-30, 2019
EditorsMuhammad Saleem, Aidan Hogan, Ricardo Usbeck, Axel-Cyrille Ngonga Ngomo, Ruben Verborgh
PublisherCEUR-WS
Pages21-36
Number of pages16
Volume2496
Publication statusPublished - 15 Nov 2019
Event3rd Workshop on Querying and Benchmarking the Web of Data, QuWeDa 2019 - Auckland, New Zealand
Duration: 26 Oct 201930 Oct 2019

Publication series

NameCEUR Workshop Proceedings
PublisherCEUR Workshop Proceedings
Volume2496
ISSN (Print)1613-0073

Conference

Conference3rd Workshop on Querying and Benchmarking the Web of Data, QuWeDa 2019
CountryNew Zealand
CityAuckland
Period26/10/1930/10/19

    Fingerprint

Keywords

  • Benchmarking methodology
  • Linked Open Data
  • RDF Lists
  • SPARQL Benchmark

Cite this

Daga, E., Meroño Peñuela, A., & Motta, E. (2019). Modelling and querying lists in RDF: A pragmatic study. In M. Saleem, A. Hogan, R. Usbeck, A-C. Ngonga Ngomo, & R. Verborgh (Eds.), QuWeDa 2019: Proceedings of the QuWeDa 2019: 3rd Workshop on Querying and Benchmarking the Web of Data co-located with 18th International Semantic Web Conference (ISWC 2019) Auckland, New Zealand, October 26-30, 2019 (Vol. 2496, pp. 21-36). (CEUR Workshop Proceedings; Vol. 2496). CEUR-WS.