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

Aidan Hogan; Jeff Z. Pan; Axel Polleres; Stefan Decker

doi:10.1007/978-3-642-17746-0_22

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

Computing Science

University of Galway

Research output: Chapter in Book/Report/Conference proceeding › Published conference contribution

37 Citations (Scopus)

Abstract

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 language	English
Title of host publication	The Semantic Web, ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010, Revised Selected Papers
Pages	337-353
Number of pages	17
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-17746-0_22
Publication status	Published - 1 Dec 2010
Event	9th International Semantic Web Conference, ISWC 2010 - Shanghai, China Duration: 7 Nov 2010 → 11 Nov 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	6496 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Semantic Web Conference, ISWC 2010
Country/Territory	China
City	Shanghai
Period	7/11/10 → 11/11/10

Access to Document

10.1007/978-3-642-17746-0_22

Cite this

Hogan, A., Pan, J. Z., Polleres, A., & Decker, S. (2010). SAOR: Template rule optimisations for distributed reasoning over 1 billion linked data triples. In The Semantic Web, ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010, Revised Selected Papers (PART 1 ed., pp. 337-353). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6496 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-17746-0_22

SAOR: Template rule optimisations for distributed reasoning over 1 billion linked data triples. / Hogan, Aidan; Pan, Jeff Z.; Polleres, Axel et al.
The Semantic Web, ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010, Revised Selected Papers. PART 1. ed. 2010. p. 337-353 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6496 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Published conference contribution

Hogan, A, Pan, JZ, Polleres, A & Decker, S 2010, SAOR: Template rule optimisations for distributed reasoning over 1 billion linked data triples. in The Semantic Web, ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010, Revised Selected Papers. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 6496 LNCS, pp. 337-353, 9th International Semantic Web Conference, ISWC 2010, Shanghai, China, 7/11/10. https://doi.org/10.1007/978-3-642-17746-0_22

Hogan A, Pan JZ, Polleres A, Decker S. SAOR: Template rule optimisations for distributed reasoning over 1 billion linked data triples. In The Semantic Web, ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010, Revised Selected Papers. PART 1 ed. 2010. p. 337-353. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-17746-0_22

Hogan, Aidan ; Pan, Jeff Z. ; Polleres, Axel et al. / SAOR : Template rule optimisations for distributed reasoning over 1 billion linked data triples. The Semantic Web, ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010, Revised Selected Papers. PART 1. ed. 2010. pp. 337-353 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).

@inproceedings{c34c5fa1d9e342d28ee8cc7ab0838a27,

title = "SAOR: Template rule optimisations for distributed reasoning over 1 billion linked data triples",

abstract = "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{\"i}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.",

author = "Aidan Hogan and Pan, {Jeff Z.} and Axel Polleres and Stefan Decker",

year = "2010",

month = dec,

day = "1",

doi = "10.1007/978-3-642-17746-0_22",

language = "English",

isbn = "364217745X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "337--353",

booktitle = "The Semantic Web, ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010, Revised Selected Papers",

edition = "PART 1",

note = "9th International Semantic Web Conference, ISWC 2010 ; Conference date: 07-11-2010 Through 11-11-2010",

}

TY - GEN

T1 - SAOR

T2 - 9th International Semantic Web Conference, ISWC 2010

AU - Hogan, Aidan

AU - Pan, Jeff Z.

AU - Polleres, Axel

AU - Decker, Stefan

PY - 2010/12/1

Y1 - 2010/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=78650905183&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-17746-0_22

DO - 10.1007/978-3-642-17746-0_22

M3 - Published conference contribution

AN - SCOPUS:78650905183

SN - 364217745X

SN - 9783642177453

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 337

EP - 353

BT - The Semantic Web, ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010, Revised Selected Papers

Y2 - 7 November 2010 through 11 November 2010

ER -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this