Efficient RDFS entailment in external memory

  • Authors:

  • Wouter J. Haffmans;George H. L. Fletcher

  • Affiliations:

  • Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands

  • Venue:
  • OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The entailment of an RDF graph under the RDF Schema standard can easily become too costly to compute and maintain. It is often more desirable to compute on-demand whether a triple exists in the entailment. This is a non-trivial task likely to incur I/O costs, since RDF graphs are often too large to fit in internal memory. As disk I/O is expensive in terms of time, I/O costs should be minimized to achieve better performance. We investigate three physical indexing methods for RDF storage on disk, comparing them using the state of the art RDF Schema entailment algorithm of Muñoz et al. In particular, the I/O behavior during entailment checking over these graph representations is studied. Extensive empirical analysis shows that an enhanced version of the state of the art indexing method, which we propose here, yields in general the best I/O performance.