The Open UniversitySkip to content
 

Modelling and Querying Lists in RDF. A Pragmatic Study

Daga, Enrico; Meroño-Peñuela, Albert and Motta, Enrico (2019). Modelling and Querying Lists in RDF. A Pragmatic Study. In: Proceedings of the 3rd Workshop on Querying the Web of Data (QuWeDa), (In Press).

Full text available as:
[img]
Preview
PDF (Accepted Manuscript) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview
URL: https://iswc2019.semanticweb.org/program-workshop/
Google Scholar: Look up in Google Scholar

Abstract

Many Linked Data datasets model elements in their domains in the form of lists: a countable number of ordered resources. When pub- lishing 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 al- ternative 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 hy- pothesis that the efficiency of retrieving sequential linked data depends primarily on how they are modelled (triple-store invariance hypothe- sis). 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 benchmark- ing linked data modelling solutions.

Item Type: Conference or Workshop Item
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Knowledge Media Institute (KMi)
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 62676
Depositing User: Enrico Daga
Date Deposited: 01 Aug 2019 15:16
Last Modified: 21 Sep 2019 07:25
URI: http://oro.open.ac.uk/id/eprint/62676
Share this page:

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU