[Back]

A. Ahmeti, A. Polleres:
"SPARQL Update under RDFS Entailment in Fully Materialized and Redundancy-Free Triple Stores";
Talk: OrdRing 2013 - 2nd International Workshop on Ordering and Reasoning, Sydney, Australien; 2013-10-21 - 2013-10-22; in: "Proceedings of the 2nd International Workshop on Ordering and Reasoning, OrdRing 2013", I. Celino, E. Valle, M. Krötzsch, S. Schlobach (ed.); CEUR-WS, Vol-1059 (2013), ISSN: 1613-0073; Paper ID 3, 12 pages.

Processing the dynamic evolution of RDF stores has recently been stan-
dardized in the SPARQL 1.1 Update specification. However, computing answers
entailed by ontologies in triple stores is usually treated orthogonal to updates.
Even the W3C´s recent SPARQL 1.1 Update language and SPARQL 1.1 Entail-
ment Regimes specifications explicitly exclude a standard behavior how SPARQL
endpoints should treat entailment regimes other than simple entailment in the
context of updates. In this paper, we take a first step to close this gap, by drawing
from query rewriting techniques explored in the context of DL-Lite. We define a
fragment of SPARQL basic graph patterns corresponding to (the RDFS fragment
of) DL-Lite and the corresponding SPARQL update language discussing possible
semantics along with potential strategies for implementing them. We treat both
(i) reduced RDF Stores, that is, redundancy-free RDF stores that do not store
any RDF triples (corresponding to DL Lite ABox statements) entailed by others
already, and (ii) materialized RDF stores, which store all entailed triples explicitly

http://ceur-ws.org/Vol-1059/ordring2013-paper3.pdf

Project Head Reinhard Pichler:
SEE: SPARQL Evaluation and Extensions