In this paper, we discuss optimisations of rule-based materialisation approaches for reasoning over large static RDF datasets. We generalise and re-formalise what we call the "partial-indexing" approach to scalable rule-based materialisation: the approach is based on a separation of terminological data, which has been shown in previous and related works to enable highly scalable and distributable reasoning for specific rulesets; in so doing, we provide some completeness propositions with respect to semi-naïve evaluation. We then show how related work on template rules - T-Box-specific dynamic rulesets created by binding the terminological patterns in the static ruleset - can be incorporated and optimised for the partial-indexing approach. We evaluate our methods using LUBM(10) for RDFS, pD*(OWL Horst) and OWL 2 RL, and thereafter demonstrate pragmatic distributed reasoning over 1.12 billion Linked Data statements for a subset of OWL 2 RL/RDF rules we argue to be suitable for Web reasoning. © 2010 Springer-Verlag.
CITATION STYLE
Hogan, A., Pan, J. Z., Polleres, A., & Decker, S. (2010). SAOR: Template rule optimisations for distributed reasoning over 1 billion linked data triples. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6496 LNCS, pp. 337–353). Springer Verlag. https://doi.org/10.1007/978-3-642-17746-0_22
Mendeley helps you to discover research relevant for your work.