SAOR: Template rule optimisations for distributed reasoning over 1 billion linked data triples

Aidan Hogan*, Jeff Z. Pan, Axel Polleres, Stefan Decker

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingPublished conference contribution

37 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationThe Semantic Web, ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010, Revised Selected Papers
Number of pages17
EditionPART 1
Publication statusPublished - 1 Dec 2010
Event9th International Semantic Web Conference, ISWC 2010 - Shanghai, China
Duration: 7 Nov 201011 Nov 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6496 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th International Semantic Web Conference, ISWC 2010


Dive into the research topics of 'SAOR: Template rule optimisations for distributed reasoning over 1 billion linked data triples'. Together they form a unique fingerprint.

Cite this