SPARQL Query Containment Under SHI Axioms

SPARQL query containment under schema axioms is the problem of determining whether, for any RDF graph satisfying a given set of schema axioms, the answers to a query are contained in the answers of another query. This problem has major applications for verification and optimization of queries. In order to solve it, we rely on the µ-calculus. Firstly, we provide a mapping from RDF graphs into transition systems. Secondly, SPARQL queries and RDFS and SHI axioms are encoded into µ-calculus formulas. This allows us to reduce query containment and equivalence to satisfiability in the µ-calculus. Finally, we prove a double exponential upper bound for containment under SHI schema axioms.

[1]  Michael Schmidt,et al.  Foundations of SPARQL query optimization , 2008, ICDT '10.

[2]  CalvaneseDiego,et al.  Conjunctive query containment and answering under description logic constraints , 2008 .

[3]  Alfred V. Aho,et al.  Equivalences Among Relational Expressions , 1979, SIAM J. Comput..

[4]  Aniello Murano,et al.  The Complexity of Enriched µ-Calculi , 2006, ICALP.

[5]  Masami Hagiya,et al.  A Decision Procedure for the Alternation-Free Two-Way Modal µ-Calculus , 2005, TABLEAUX.

[6]  Ian Horrocks,et al.  SPARQL Query Answering over OWL Ontologies , 2011, ESWC.

[7]  Evaggelia Pitoura.  Query Optimization , 2009, Encyclopedia of Database Systems.

[8]  Carsten Lutz,et al.  The Complexity of Conjunctive Query Answering in Expressive Description Logics , 2008, IJCAR.

[9]  Jorge Pérez,et al.  Minimal Deductive Systems for RDF , 2007, ESWC.

[10]  Masami Hagiya,et al.  A decision procedure for alternation-free modal µ-calculi , 2008, Advances in Modal Logic.

[11]  Axel Polleres,et al.  From SPARQL to rules (and back) , 2007, WWW '07.

[12]  Jérôme Euzenat,et al.  SPARQL Query Containment under RDFS Entailment Regime , 2012, IJCAR.

[13]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[14]  Shiyong Lu,et al.  Semantics Preserving SPARQL-to-SQL Query Translation for Optional Graph Patterns. Technical Report T , 2006 .

[15]  Claudio Gutiérrez,et al.  The Expressive Power of SPARQL , 2008, SEMWEB.

[16]  Marcelo Arenas,et al.  Semantics and complexity of SPARQL , 2006, TODS.

[17]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[18]  Jos de Bruijn,et al.  Logical Foundations of RDF(S) with Datatypes , 2010, J. Artif. Intell. Res..

[19]  Diego Calvanese,et al.  The DL-Lite Family and Relations , 2009, J. Artif. Intell. Res..

[20]  Richard Cyganiak,et al.  A relational algebra for SPARQL , 2005 .

[21]  David S. Johnson,et al.  Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies , 1984, J. Comput. Syst. Sci..

[22]  Pierre Genevès,et al.  Efficient static analysis of XML paths and types , 2007, PLDI '07.

[23]  E. Prud hommeaux,et al.  SPARQL query language for RDF , 2011 .

[24]  Aniello Murano,et al.  The Complexity of Enriched Mu-Calculi , 2008, Log. Methods Comput. Sci..

[25]  Diego Calvanese,et al.  Conjunctive query containment and answering under description logic constraints , 2008, TOCL.

[26]  Jean-François Baget,et al.  Extending SPARQL with regular expression patterns (for querying RDF) , 2009, J. Web Semant..

[27]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[28]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.

[29]  Ulrike Sattler,et al.  The Hybrid µ-Calculus , 2001, IJCAR.

[30]  Thomas Eiter,et al.  Query answering in description logics with transitive roles , 2009, IJCAI 2009.

[31]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[32]  Ian Horrocks,et al.  Conjunctive Query Answering for the Description Logic SHIQ , 2007, IJCAI.

[33]  Raghu Ramakrishnan,et al.  Containment of conjunctive queries: beyond relations as sets , 1995, TODS.

[34]  Jérôme Euzenat,et al.  PSPARQL Query Containment , 2011, DBPL.