@inproceedings{hoga-etal-2010ISWC,
	Abstract = {In this paper, we discuss generic 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-naive 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 in the partial-indexing approach, and optimisations that are possible thereafter. We demonstrate our methods using LUBM(10) for RDFS, pD* (OWL Horst) and OWL 2 RL, and thereafter demonstrate pragmatic distributed reasoning over 1.12b Linked Data triples for a subset of OWL 2 RL we argue to be suitable for the Web use-case.},
	Address = {Shanghai, China},
	Author = {Aidan Hogan and Jeff Z. Pan and Axel Polleres and Stefan Decker},
	Booktitle = {Proceedings of the 9th International Semantic Web Conference (ISWC 2010)},
	Day = {7--11},
	Month = nov,
	Page = {337--353},
	Publisher = {Springer},
	Series = LNCS,
	Title = {{SAOR}: Template Rule Optimisations for Distributed Reasoning over 1 Billion Linked Data Triples},
	Url = {http://iswc2010.semanticweb.org/pdf/305.pdf},
	Volume = 6496,
	Year = 2010,
	Bdsk-Url-1 = {http://iswc2010.semanticweb.org/pdf/305.pdf}}

{"_id":{"_str":"51f5f791a57e92543f00074a"},"__v":33,"authorIDs":["545720922abc8e9f370000ae","545742cb2abc8e9f3700022f","545808892abc8e9f370009fc","54598571b43425b772000678","5PFMiHGwfvbGBZwWF","5de7280d97054edf010000c3","5e02b1a419da8edf01000028","5e048450db7916df010000b1","5e06d565a0810cde0100009b","5e10e27445c12cde01000062","5e123345c196d3de01000074","5e14ba61e55ed8de01000072","5e189b4e779abfdf0100013f","5e216f7e5a651cdf010000eb","5e25b9fdf299d4de01000001","5e2d64605e7586df01000083","5e36e5e9b26a0fde0100005e","5e37d23b56571fde010000de","5e4ded1052c311f20100018e","5e51a3102793ecde010000e0","5e59a6b5ad6c7fde01000114","5e5d588ead47bcde01000072","5e60e857839e59df010000f1","A5AFuDAiNR4HEYiFD","BtzwZ6TFPsASbdqvo","DLdeXAmrbA4niYQzH","FyLDFGg993nDS2Spf","NCjPvWahWRjdP3ghB","XcyP3jptz7zE4ZLws","aiXjXMLP63k5WCt84","fTDcT5K3oSTcdxSBj","fbKNfWffDzdzubrER","haaAs2rQaQA7EaZva","nQX2P8WzFeKwcpLqd","nuWuyLnGu7YzMrn4d","pfENTBFWo85mRy3ik","rX6EShFR2rMFmQL2C","w6wHZukTjqqera7BR","woa42kCD35yCmdQTj","yPgvarsL7KAT9yfZd","yzkCNJMYNL8B3bni2","zDG3tj87ZfYXo7u9c"],"author_short":["Hogan, A.","Pan, J. Z.","Polleres, A.","Decker, S."],"bibbaseid":"hogan-pan-polleres-decker-saortemplateruleoptimisationsfordistributedreasoningover1billionlinkeddatatriples-2010","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"In this paper, we discuss generic 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-naive 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 in the partial-indexing approach, and optimisations that are possible thereafter. We demonstrate our methods using LUBM(10) for RDFS, pD* (OWL Horst) and OWL 2 RL, and thereafter demonstrate pragmatic distributed reasoning over 1.12b Linked Data triples for a subset of OWL 2 RL we argue to be suitable for the Web use-case.","address":"Shanghai, China","author":[{"firstnames":["Aidan"],"propositions":[],"lastnames":["Hogan"],"suffixes":[]},{"firstnames":["Jeff","Z."],"propositions":[],"lastnames":["Pan"],"suffixes":[]},{"firstnames":["Axel"],"propositions":[],"lastnames":["Polleres"],"suffixes":[]},{"firstnames":["Stefan"],"propositions":[],"lastnames":["Decker"],"suffixes":[]}],"booktitle":"Proceedings of the 9th International Semantic Web Conference (ISWC 2010)","day":"7–11","month":"November","page":"337–353","publisher":"Springer","series":"Lecture Notes in Computer Science (LNCS)","title":"SAOR: Template Rule Optimisations for Distributed Reasoning over 1 Billion Linked Data Triples","url":"http://iswc2010.semanticweb.org/pdf/305.pdf","volume":"6496","year":"2010","bdsk-url-1":"http://iswc2010.semanticweb.org/pdf/305.pdf","bibtex":"@inproceedings{hoga-etal-2010ISWC,\n\tAbstract = {In this paper, we discuss generic 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-naive 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 in the partial-indexing approach, and optimisations that are possible thereafter. We demonstrate our methods using LUBM(10) for RDFS, pD* (OWL Horst) and OWL 2 RL, and thereafter demonstrate pragmatic distributed reasoning over 1.12b Linked Data triples for a subset of OWL 2 RL we argue to be suitable for the Web use-case.},\n\tAddress = {Shanghai, China},\n\tAuthor = {Aidan Hogan and Jeff Z. Pan and Axel Polleres and Stefan Decker},\n\tBooktitle = {Proceedings of the 9th International Semantic Web Conference (ISWC 2010)},\n\tDay = {7--11},\n\tMonth = nov,\n\tPage = {337--353},\n\tPublisher = {Springer},\n\tSeries = LNCS,\n\tTitle = {{SAOR}: Template Rule Optimisations for Distributed Reasoning over 1 Billion Linked Data Triples},\n\tUrl = {http://iswc2010.semanticweb.org/pdf/305.pdf},\n\tVolume = 6496,\n\tYear = 2010,\n\tBdsk-Url-1 = {http://iswc2010.semanticweb.org/pdf/305.pdf}}\n\n","author_short":["Hogan, A.","Pan, J. Z.","Polleres, A.","Decker, S."],"key":"hoga-etal-2010ISWC","id":"hoga-etal-2010ISWC","bibbaseid":"hogan-pan-polleres-decker-saortemplateruleoptimisationsfordistributedreasoningover1billionlinkeddatatriples-2010","role":"author","urls":{"Paper":"http://iswc2010.semanticweb.org/pdf/305.pdf"},"metadata":{"authorlinks":{"polleres, a":"https://bibbase.org/show?bib=www.polleres.net/mypublications.bib"}}},"bibtype":"inproceedings","biburl":"www.polleres.net/mypublications.bib","downloads":0,"keywords":[],"search_terms":["saor","template","rule","optimisations","distributed","reasoning","over","billion","linked","data","triples","hogan","pan","polleres","decker"],"title":"SAOR: Template Rule Optimisations for Distributed Reasoning over 1 Billion Linked Data Triples","title_words":["saor","template","rule","optimisations","distributed","reasoning","over","billion","linked","data","triples"],"year":2010,"dataSources":["cBfwyqsLFQQMc4Fss","gixxkiKt6rtWGoKSh","QfLT6siHZuHw9MqvK"]}