Reifying RDF: What Works Well With Wikidata?

Research output: Contribution to book/conference proceedings/anthology/reportConference contributionContributedpeer-review

Contributors

  • Daniel Hernández - , Universidad de Santiago de Chile (Author)
  • Aidan Hogan - , Universidad de Santiago de Chile (Author)
  • Markus Krötzsch - , Chair of Automata Theory (Author)

Abstract

In this paper, we compare various options for reifying RDF triples. We are motivated by the goal of representing Wikidata as RDF, which would allow legacy Semantic Web languages, techniques and tools - for example, SPARQL engines - to be used for Wikidata. However, Wikidata annotates statements with qualifiers and references, which require some notion of reification to model in RDF. We thus investigate four such options: (1) standard reification, (2) n-ary relations, (3) singleton properties, and (4) named graphs. Taking a recent dump of Wikidata, we generate the four RDF datasets pertaining to each model and discuss high-level aspects relating to data sizes, etc. To empirically compare the effect of the different models on query times, we collect a set of benchmark queries with four model-specific versions of each query. We present the results of running these queries against five popular SPARQL implementations: 4 store, BlazeGraph, GraphDB, Jena TDB and Virtuoso.

Details

Original languageEnglish
Title of host publicationProceedings of the 11th International Workshop on Scalable Semantic Web Knowledge Base Systems
EditorsThorsten Liebig, Achille Fokoue
Pages32-47
Number of pages16
Publication statusPublished - 2015
Peer-reviewedYes

Publication series

SeriesCEUR Workshop Proceedings
Volume1457
ISSN1613-0073

External IDs

researchoutputwizard legacy.publication#68938
Scopus 84945174050