Efficient RDFS entailment in external memory

W.J. Haffmans, G.H.L. Fletcher

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

3 Citations (Scopus)
1 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationOn the Move to Meaningful Internet Systems: OTM 2011 Workshops (Hersonissos, Crete, Greece, October 17-21, 2011. Proceedings)
EditorsR. Meersman, T. Dillon, P. Herrero
Place of PublicationBerlin
PublisherSpringer
Pages464-473
ISBN (Print)978-3-642-25125-2
DOIs
Publication statusPublished - 2011

Publication series

NameLecture Notes in Computer Science
Volume7046
ISSN (Print)0302-9743

Fingerprint

Data storage equipment
Costs

Cite this

Haffmans, W. J., & Fletcher, G. H. L. (2011). Efficient RDFS entailment in external memory. In R. Meersman, T. Dillon, & P. Herrero (Eds.), On the Move to Meaningful Internet Systems: OTM 2011 Workshops (Hersonissos, Crete, Greece, October 17-21, 2011. Proceedings) (pp. 464-473). (Lecture Notes in Computer Science; Vol. 7046). Berlin: Springer. https://doi.org/10.1007/978-3-642-25126-9_58
Haffmans, W.J. ; Fletcher, G.H.L. / Efficient RDFS entailment in external memory. On the Move to Meaningful Internet Systems: OTM 2011 Workshops (Hersonissos, Crete, Greece, October 17-21, 2011. Proceedings). editor / R. Meersman ; T. Dillon ; P. Herrero. Berlin : Springer, 2011. pp. 464-473 (Lecture Notes in Computer Science).
@inproceedings{0239dc373a194a95adcfa95eacbf5f3c,
title = "Efficient RDFS entailment in external memory",
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{\~n}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.",
author = "W.J. Haffmans and G.H.L. Fletcher",
year = "2011",
doi = "10.1007/978-3-642-25126-9_58",
language = "English",
isbn = "978-3-642-25125-2",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "464--473",
editor = "R. Meersman and T. Dillon and P. Herrero",
booktitle = "On the Move to Meaningful Internet Systems: OTM 2011 Workshops (Hersonissos, Crete, Greece, October 17-21, 2011. Proceedings)",
address = "Germany",

}

Haffmans, WJ & Fletcher, GHL 2011, Efficient RDFS entailment in external memory. in R Meersman, T Dillon & P Herrero (eds), On the Move to Meaningful Internet Systems: OTM 2011 Workshops (Hersonissos, Crete, Greece, October 17-21, 2011. Proceedings). Lecture Notes in Computer Science, vol. 7046, Springer, Berlin, pp. 464-473. https://doi.org/10.1007/978-3-642-25126-9_58

Efficient RDFS entailment in external memory. / Haffmans, W.J.; Fletcher, G.H.L.

On the Move to Meaningful Internet Systems: OTM 2011 Workshops (Hersonissos, Crete, Greece, October 17-21, 2011. Proceedings). ed. / R. Meersman; T. Dillon; P. Herrero. Berlin : Springer, 2011. p. 464-473 (Lecture Notes in Computer Science; Vol. 7046).

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

TY - GEN

T1 - Efficient RDFS entailment in external memory

AU - Haffmans, W.J.

AU - Fletcher, G.H.L.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-25126-9_58

DO - 10.1007/978-3-642-25126-9_58

M3 - Conference contribution

SN - 978-3-642-25125-2

T3 - Lecture Notes in Computer Science

SP - 464

EP - 473

BT - On the Move to Meaningful Internet Systems: OTM 2011 Workshops (Hersonissos, Crete, Greece, October 17-21, 2011. Proceedings)

A2 - Meersman, R.

A2 - Dillon, T.

A2 - Herrero, P.

PB - Springer

CY - Berlin

ER -

Haffmans WJ, Fletcher GHL. Efficient RDFS entailment in external memory. In Meersman R, Dillon T, Herrero P, editors, On the Move to Meaningful Internet Systems: OTM 2011 Workshops (Hersonissos, Crete, Greece, October 17-21, 2011. Proceedings). Berlin: Springer. 2011. p. 464-473. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-25126-9_58