SPARQL Update for Materialized Triple Stores under DL-Lite RDFS Entailment Albin Ahmeti (TU Wien) Diego Calvanese (Uni Bolzano) Axel Polleres (WU Wien)

Slides:



Advertisements
Similar presentations
RDFTL: An Event-Condition- Action Language for RDF George Papamarkos Alexandra Poulovassilis Peter T. Wood School of Computer Science and Information Systems.
Advertisements

Substitution & Evaluation Order cos 441 David Walker.
Copyright 2009 Digital Enterprise Research Institute. All rights reserved. Digital Enterprise Research Institute Uniasdsd Dynamic querying.
Inference Rules Universal Instantiation Existential Generalization
An Introduction to Description Logics
WIMS 2014, June 2-4Thessaloniki, Greece1 Optimized Backward Chaining Reasoning System for a Semantic Web Hui Shi, Kurt Maly, and Steven Zeil Contact:
Optimizing Join Enumeration in Transformation-based Query Optimizers ANIL SHANBHAG, S. SUDARSHAN IIT BOMBAY VLDB 2014
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
Ontological Logic Programming by Murat Sensoy, Geeth de Mel, Wamberto Vasconcelos and Timothy J. Norman Computing Science, University of Aberdeen, UK 1.
Evolution in OWL 2 QL & OWL 2 EL Ontologies Dmitriy Zheleznyakov 28 th of January, 2014, Oslo.
High-level Data Access Based on Query Rewritings Ekaterina Stepalina Higher School of Economics.
RDF Databases By: Chris Halaschek. Outline Motivation / Requirements Storage Issues Sesame General Introduction Architecture Scalability RQL Introduction.
CSE 425: Semantic Analysis Semantic Analysis Allows rigorous specification of a program’s meaning –Lets (parts of) programming languages be proven correct.
1 LCW-Based Agent Planning for the Semantic Web Jeff Heflin, Hector Muñoz-Avila presented by Axel Polleres cf.
Ameet N Chitnis, Abir Qasem and Jeff Heflin 11 November 2007.
Reasoning and Identifying Relevant Matches for XML Keyword Search Yi Chen Ziyang Liu, Yi Chen Arizona State University.
 Copyright 2008 Digital Enterprise Research Institute. All rights reserved. Digital Enterprise Research Institute Context Dependent Reasoning.
1 RDF Aggregate Queries and Views Edward Hung, Yu Deng, V.S. Subrahmanian University of Maryland, College Park ICDE 2005, April 7, Tokyo, Japan.
Formalisms and Verification for Transactional Memories Vasu Singh EPFL Switzerland.
How can Computer Science contribute to Research Publishing?
Annotating Documents for the Semantic Web Using Data-Extraction Ontologies Dissertation Proposal Yihong Ding.
Chapter 4 Linked Structures. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 4-2 Chapter Objectives Describe the use of references to create.
Triple Stores.
TAPP-09 23/02/2009Giorgos Flouris1 On Explicit Provenance Management in RDF/S Graphs Institute of Computer Science Foundation for Research and Technology.
OMAP: An Implemented Framework for Automatically Aligning OWL Ontologies SWAP, December, 2005 Raphaël Troncy, Umberto Straccia ISTI-CNR
Managing Large RDF Graphs (Infinite Graph) Vaibhav Khadilkar Department of Computer Science, The University of Texas at Dallas FEARLESS engineering.
From SQL to SPARQL Symposium zur Pensionierung Prof. Wolfgang Panny Axel Polleres web:
Reasoning the FMA Ontologies with TrOWL Jeff Z. Pan, Yuan Ren, Nophadol Jekjantuk, and Jhonatan Garcia University of Aberdeen, UK ORE2013.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
An Introduction to Description Logics. What Are Description Logics? A family of logic based Knowledge Representation formalisms –Descendants of semantic.
Applying Belief Change to Ontology Evolution PhD Student Computer Science Department University of Crete Giorgos Flouris Research Assistant.
Ontology Updating Driven by Events Dutch-Belgian Database Day 2012 (DBDBD 2012) November 21, 2012 Frederik Hogenboom Jordy Sangers.
IDB, SNU Dong-Hyuk Im Efficient Computing Deltas between RDF Models using RDFS Entailment Rules (working title)
Reviewing Recent ICSE Proceedings For:.  Defining and Continuous Checking of Structural Program Dependencies  Automatic Inference of Structural Changes.
-1- Philipp Heim, Thomas Ertl, Jürgen Ziegler Facet Graphs: Complex Semantic Querying Made Easy Philipp Heim 1, Thomas Ertl 1 and Jürgen Ziegler 2 1 Visualization.
Using the TBox to Optimise SPARQL Queries Birte Glimm Yevgeny Kazakov Ilianna Kollia and Giorgos Stamou CS 848 Paper Critique Vishnu Prathish.
Pavan Reddiavri (Ebiquity Labs) “R ♫ P” RDF Access control Policies.
Angela Bonifati, “Active XQuery”, ICDE Active XQuery A. Bonifati, D. Braga, A. Campi, S. Ceri Politecnico di Milano (Italy)
An Introduction to Description Logics (chapter 2 of DLHB)
Checking Reachability using Matching Logic Grigore Rosu and Andrei Stefanescu University of Illinois, USA.
A Mechanized Model for CAN Protocols Context and objectives Our mechanized model Results Conclusions and Future Works Francesco Bongiovanni and Ludovic.
Updating ABoxes in DL-Lite D. Calvanese, E. Kharlamov, W. Nutt, D. Zheleznyakov Free University of Bozen-Bolzano AMW 2010, May 2010.
Automated Patch Generation Adapted from Tevfik Bultan’s Lecture.
Scalable Distributed Reasoning Using MapReduce Jacopo Urbani, Spyros Kotoulas, Eyal Oren, and Frank van Harmelen Department of Computer Science, Vrije.
Logical Agents Chapter 7. Knowledge bases Knowledge base (KB): set of sentences in a formal language Inference: deriving new sentences from the KB. E.g.:
LDK R Logics for Data and Knowledge Representation ClassL (Propositional Description Logic with Individuals) 1.
Of 38 lecture 6: rdf – axiomatic semantics and query.
SPARQL1.1 Updates and Entailment - Why the specification is silent about their interaction Axel Polleres web:
1 Reasoning with Infinite stable models Piero A. Bonatti presented by Axel Polleres (IJCAI 2001,
CS162 Week 4 Kyle Dewey. Overview Reactive imperative programming in a nutshell Reactive imperative programming implementation details.
Semantic Web for the Working Ontologist Dean Allemang Jim Hendler SNU IDB laboratory Last modified,
Introduction to the Semantic Web Jeff Heflin Lehigh University.
GRIN: A Graph Based RDF Index Octavian Udrea 1 Andrea Pugliese 2 V. S. Subrahmanian 1 1 University of Maryland College Park 2 Università di Calabria.
1 Instance Store Database Support for Reasoning over Individuals S Bechhofer, I Horrocks, D Turi. Instance Store - Database Support for Reasoning over.
An Optimization Technique for RDFS Inference using the Application Order of RDFS Entailment Rules Kisung Kim, Taewhi Lee
Proof Methods for Propositional Logic CIS 391 – Intro to Artificial Intelligence.
Ontology Technology applied to Catalogues Paul Kopp.
Towards a Semantic Model for Java Wildcards Sophia Drossopoulou Mariangiola Dezani-Ciancaglini Imperial College London Università di Torino Italy Nicholas.
Certifying and Synthesizing Membership Equational Proofs Patrick Lincoln (SRI) joint work with Steven Eker (SRI), Jose Meseguer (Urbana) and Grigore Rosu.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
SPARQL Query Andy Seaborne. Apache Jena he.org/jena ● Open source - Apache License ● Apache Incubator (accepted November 2010) ●
A Kernel Revision Operator for Terminologies Algorithms and Evaluation
File Organization and Processing Week 3
Names and Attributes Names are a key programming language feature
MySQL Subquery Source: Dev.MySql.com
B-Trees 7/5/2018 4:26 AM Presentation for use with the textbook Data Structures and Algorithms in Java, 6th edition, by M. T. Goodrich, R. Tamassia, and.
Logical Agents.
Updating TBoxes in DL-Lite
Automated Patch Generation
CC La Web de Datos Primavera 2018 Lecture 8: SPARQL [1.1]
Presentation transcript:

SPARQL Update for Materialized Triple Stores under DL-Lite RDFS Entailment Albin Ahmeti (TU Wien) Diego Calvanese (Uni Bolzano) Axel Polleres (WU Wien) 1

Motivation Recent standardization of SPARQL 1.1 Update, and SPARQL 1.1 Entailment Regimes with triple stores implementing those standards (often done with materialization) Query rewriting techniques already explored in the context of DL-Lite and OBDA… do they help us with updates as well? Emerging the need for a more systematic approach of dealing with SPARQL 1.1 Update over ABoxes & TBox-es Nothing endures but change. - Heraclitus 2

3 DELETE { ?X a :Child. } INSERT { ?Y a :Mother. } WHERE { ?X :hasParent ?Y. } What should a triple store do in such a situation? What does it mean to... DELETE an implicit triple? INSERT an already implied triple? WHERE matching variables on implicit triples?

State of the art What do off-the-shelf triple stores do? – Entailment typically only handled at (bulk) loading by materialization but not in the context of Updates. – no “standard” behavior for Delete &Insert upon materialized stores. – interplay of Entailments and Update left out in the SPARQL 1.1 spec. Approaches in the literature on updates and RDFS (or also DLs) limited to atomic update operations… – [Gutierrez et al., ESWC2011] ABox deletions in the context of RDFS – [Calvanese et al., ISWC2010] ABox & TBox insertions in the context of DL-Lite (incl. inconsistency repair) …but no combined treatment of DELETE + INSERT + BGP matching in the WHERE clause as in SPARQL1.1 Update Also related to our approach – Deductive DBs: [Gupta et al., SIGMOD93], Maintaining Views Incrementally – KB evolution, Belief revision, etc.: Various works in classical AI and philosophy 4

[Munoz et al., ESWC2007] Minimal RDFS (ABox-) Inference Rules (Abox-)Materialized stores: 5 materialize(G)... SPO :Motherrdfs:subClassOf:Parent :hasMotherrdfs:subPropertyOf:hasParent :hasMotherrdfs:range:Mother :hasParentrdfs:domain:Child :hasParentrdfs:range:Parent...

SPARQL Query answering under RDFS Entailment: 6 materialize(G)... SELECT ?Y WHERE { :joe :hasParent ?Y. } SPO :Motherrdfs:subClassOf:Parent :hasMotherrdfs:subPropertyOf:hasParent :hasMotherrdfs:range:Mother :hasParentrdfs:domain:Child :hasParentrdfs:range:Parent... SELECT ?Y WHERE { { :joe :hasParent ?Y. } UNION {:joe :hasMother ?Y. } UNION {:joe :hasFather ?Y. } rewrite(q,T) ans(rewrite(q, T), G \ T) = ans(q, materialize(G) \ T) Well known:

What does that now mean for updates? Our Contribution: Discuss possible update semantics in the context of materialized stores & RDFS. Even in this restricted setting (RDFS) this turns out to be challenging: Our setting: – In case of ABox updates, TBox fixed – Use "minimal"RDFS as TBox language (without axiomatic triples, blank nodes) … i.e., DL-Lite RDFS – Restrict on BGPs to only allow ABox Insert/Deletes INSERT {:joe :hasFather ?Y } WHERE {:joe :hasParent ?Y } INSERT {:joe :hasFather ?Y } WHERE {:joe :hasParent ?Y } INSERT {:joe ?Y :foo} WHERE {:joe rdf:type ?Y } INSERT {:joe ?Y :foo} WHERE {:joe rdf:type ?Y } 7

Proposed ABox update semantics Materialized-preserving semantics – Sem 0 … baseline semantics – Sem 1a – Sem 1b – Sem 2 … delete incl. causes and rewrite upon inserts – Sem 3 … intuition: combination of Sem 1 and Sem 2 8 inspired by DRed: delete incl. effects and rederive upon inserts }

Baseline semantics Sem 0 – Naïve Update followed by re-materialization 9

Sem 0 : Naïve Update followed by re-materialization SPO :Motherrdfs:subClassOf:Parent :hasMotherrdfs:subPropertyOf:hasParent :hasMotherrdfs:range:Mother :hasParentrdfs:domain:Child :hasParentrdfs:range:Parent... SPO :joe:hasMother:jane :joea:Child :joe:hasParent:jane a:Mother :janea:Parent DELETE { ?X a :Child. } INSERT { ?Y a :Mother. } WHERE { ?X :hasParent ?Y. } ?X=:joe ?Y=:jane DELETE { :joe a :Child. } INSERT { :jane a :Mother. } DELETE { :joe a :Child. } INSERT { :jane a :Mother. } SPO :joe:hasMother:jane :joe:hasParent:jane a:Mother :janea:Parent materialize(G) SPO :joe:hasMother:jane :joea:Child :joe:hasParent:jane a:Mother :janea:Parent No effect!

Alternative Materialized-pres. semantics Sem 1a – “Delete and rederive” Remove DELETEs triples incl. Effects 2. INSERT triples 3. Re-materialize

Sem 1a : Delete and rederive SPO :Motherrdfs:subClassOf:Parent :hasMotherrdfs:subPropertyOf:hasParent :hasMotherrdfs:range:Mother :hasParentrdfs:domain:Child :hasParentrdfs:range:Parent... SPO :joe:hasMother:jane :joea:Child :joe:hasParent:jane a:Mother :janea:Parent DELETE { :joe :hasMother :jane. } DELETE { :joe :hasMother :jane. :joe :hasParent :jane. :joe a Child. :jane a Mother. :jane a Parent. } DELETE { :joe :hasMother :jane. :joe :hasParent :jane. :joe a Child. :jane a Mother. :jane a Parent. } SPO materialize(G) SPO May be viewed quite "radical"

Sem 1a : Delete and rederive SPO :Motherrdfs:subClassOf:Parent :hasMotherrdfs:subPropertyOf:hasParent :hasMotherrdfs:range:Mother :hasParentrdfs:domain:Child :hasParentrdfs:range:Parent... SPO :joe:hasMother:jane :joea:Child :joe:hasParent:jane a:Mother :janea:Parent DELETE { :joe :hasParent :jane. } DELETE { :joe :hasParent :jane. :joe a Child. :jane a Parent. } DELETE { :joe :hasParent :jane. :joe a Child. :jane a Parent. } SPO :joe:hasMother:jane a:Mother materialize(G) SPO :joe:hasMother:jane :joea:Child :joe:hasParent:jane a:Mother :janea:Parent Again: no effect!

Alternative Materialized-pres. semantics Sem 1b – Variant of Sem 1a, that makes a distinction between explicit and implicit triples – Re-materialization from scratch from 14

Sem 1b : Delete and rederive with separating "explicit" and "implicit" ABox SPO :Motherrdfs:subClassOf:Parent :hasMotherrdfs:subPropertyOf:hasParent :hasMotherrdfs:range:Mother :hasParentrdfs:domain:Child :hasParentrdfs:range:Parent... SPO :joe:hasMother:jane :joea:Child :joe:hasParent:jane a:Mother :janea:Parent DELETE { :joe :hasParent :jane. } materialize(G) SPO :joe:hasMother:jane :joea:Child :joe:hasParent:jane a:Mother :janea:Parent Again: no effect! ABox expl ABox impl SPO :joe:hasMother:jane :joe:hasParent:jane SPO :joe:hasMother:jane Abox' impl

Alternative Materialized-pres. semantics Sem 2 – Delete the instantiations of plus all their causes; – Insert the instantiations of plus all their effects. 16

17 Sem 2

18 Sem 2

19 Sem 2 DELETE following INSERT is NOT idempotent!

Another alternative Materialized-pres. semantics Sem 3 – Idea: Combine Sem 1 and Sem 2, i.e. – Additionally (recursively) delete “dangling” effects for instantiations of i.e. triples that would not be implied any longer by any non-deleted triples after deletion No formalization given yet, but let’s check the intuition… 20

21 Sem 3

22 Recall: the intuition was to additionally delete triples that would not be implied any longer by any non-deleted triples after deletion.

TBox updates In this setting – We expand BGPs to take into account TBox Inserts/Deletes – general BGPs – Tbox inserts are trivial in this setting of RDFS. – TBox deletions for RDFS are ambiguous (minimal cuts) [Gutierrez et al., ESWC2011] Opens various degrees of freedom… What if we consider a materialized Tbox? – We also use two RDFS rules for TBox materialization. DELETE {:A rdfs:subClassOf ?C. } 23

Minimal cuts are ambiguous! 24

Proposed TBox update semantics For materialized Tboxes, we define a canonical way to delete explicit and implicit TBox triples – Outbound cut For each triple, where we replace with: add to 25

Proposed TBox update semantics Outbound cut: Intuition 26 DELETE { :A rdfs:subClassOf :F. } DELETE { :A rdfs:subClassOf ?X. } WHERE { :A rdfs:subClassOf ?X. ?X rdfs:subClassOf* :F. } Idea: Can be implemented with SPARQL 1.1 property paths

27 Sem outcut

28 Sem outcut

Proposed TBox update semantics Canonical way to delete explicit and implicit TBox triples – Inbound cut For each triple, where we replace with: add to 29

Analogous alternative: Sem incut Inbound cut: Intuition 30 DELETE { ?X rdfs:subClassOf :F. } WHERE { :A rdfs:subClassOf* ?X. ?X rdfs:subClassOf :F. }

31 SPARQL 1.1 property path

32

Prototype & Evaluation A prototype is available in Java using Jena API implementing the proposed update semantics – e-rewriter/index.html e-rewriter/index.html 33

Conclusions This preliminary research is the first step to close the gap left by the current standards (SPARQL1.1 Update vs. SPARQL1.1 Entailment Regimes) We looked into various materialized preserving semantics – Seemingly no “one-size fits all” semantics – Non-intuitive corner cases in each semantics  depends on use case? SPARQL 1.1 Update, i.e. pairing DELETE and INSERT templates with a common WHERE clause (BGP matching) imposes a non-trivial challenge! 34

Future work Extend with OWL QL/RL features for expressing TBox – Benefit from a more expressive query language – Exploit different Query rewriting algorithms? Optimisations – Imposes new challenges such as dealing with inconsistencies – Discuss complexity Implementation and evaluation of proposed update semantics against different triple stores 35