Taming the Infinite Chase: Query Answering under Expressive Relational Constraints

The chase algorithm is a fundamental tool for query evaluation and for testing query containment under tuple-generating dependencies (TGDs) and equality-generating dependencies (EGDs). So far, most of the research on this topic has focused on cases where the chase procedure terminates. This paper introduces expressive classes of TGDs defined via syntactic restrictions: guarded TGDs (GTGDs) and weakly guarded sets of TGDs (WGT-GDs). For these classes, the chase procedure is not guaranteed to terminate and thus may have an infinite outcome. Nevertheless, we prove that the problems of conjunctive-query answering and query containment under such TGDs are decidable. We provide decision procedures and tight complexity bounds for these problems. Then we show how EGDs can be incorporated into our results by providing conditions under which EGDs do not harmfully interact with TGDs and do not affect the decidability and complexity of query answering. We show applications of the aforesaid classes of constraints to the problem of answering conjunctive queries in F-Logic Lite, an object-oriented ontology language, and in some tractable Description Logics.

[1]  Georg Gottlob,et al.  Data exchange: computing cores in polynomial time , 2006, PODS '06.

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

[3]  Sebastian Rudolph,et al.  Conjunctive Queries for EL with Composition of Roles , 2007, Description Logics.

[4]  Thomas Eiter,et al.  FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols , 2010, TOCL.

[5]  Andrea Calì.  Querying Incomplete Data with Logic Programs: ER Strikes Back , 2007, ER.

[6]  Georg Gottlob,et al.  Hypertree Decompositions: A Survey , 2001, MFCS.

[7]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[8]  Bruno Marnette,et al.  Generalized schema-mappings: from termination to tractability , 2009, PODS.

[9]  Catriel Beeri,et al.  The Implication Problem for Data Dependencies , 1981, ICALP.

[10]  Erich Grädel,et al.  Decidability issues for action guarded logics , 2000, Description Logics.

[11]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs VIII: Orientations , 1995, Ann. Pure Appl. Log..

[12]  Georg Gottlob,et al.  Hypertree width and related hypergraph invariants , 2007, Eur. J. Comb..

[13]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[14]  Boris Motik,et al.  Tractable query answering and rewriting under description logic constraints , 2010, J. Appl. Log..

[15]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[16]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[17]  Catriel Beeri,et al.  Properties of acyclic database schemes , 1981, STOC '81.

[18]  Daniel Mailharro,et al.  A classification and constraint-based framework for configuration , 1998, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[19]  Alin Deutsch,et al.  Reformulation of XML Queries and Constraints , 2003, ICDT.

[20]  Riccardo Rosati.  On the decidability and finite controllability of query processing in databases with incomplete information , 2006, PODS '06.

[21]  Georg Gottlob,et al.  Querying the Guarded Fragment , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[22]  Xiaolei Qian,et al.  Query folding , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[23]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[24]  Todd D. Millstein,et al.  Query containment for data integration systems , 2000, PODS '00.

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

[26]  Christoph Koch,et al.  Query rewriting with symmetric constraints , 2002, AI Commun..

[27]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2005, Theor. Comput. Sci..

[28]  Peter F. Patel-Schneider,et al.  A comparison of two modelling paradigms in the Semantic Web , 2007, J. Web Semant..

[29]  Alin Deutsch,et al.  The chase revisited , 2008, PODS.

[30]  David S. Johnson,et al.  Testing containment of conjunctive queries under functional and inclusion dependencies , 1982, J. Comput. Syst. Sci..

[31]  Johann A. Makowsky,et al.  Embedded implicational dependencies and their inference problem , 1981, STOC '81.

[32]  Laurian M. Chirica,et al.  The entity-relationship model: toward a unified view of data , 1975, SIGF.

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

[34]  Andrea Calì,et al.  Query rewriting and answering under constraints in data integration systems , 2003, IJCAI.

[35]  Carsten Lutz,et al.  Conjunctive Query Answering in the Description Logic EL Using a Relational Database System , 2009, IJCAI.

[36]  John C. Mitchell.  The Implication Problem for Functional and Inclusion Dependencies , 1984, Inf. Control..

[37]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[38]  Michael Kifer,et al.  Logical foundations of object-oriented and frame-based languages , 1995, JACM.

[39]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[40]  Stijn Heymans,et al.  Guarded Open Answer Set Programming , 2005, LPNMR.

[41]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[42]  Ronald Fagin,et al.  Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.

[43]  Jan Chomicki,et al.  Consistent query answers in inconsistent databases , 1999, PODS '99.

[44]  Andrea Calì,et al.  Containment of conjunctive object meta-queries , 2006, VLDB.

[45]  Ian Horrocks,et al.  A software framework for matchmaking based on semantic web technology , 2003, WWW '03.

[46]  Moshe Y. Vardi,et al.  The Implication Problem for Functional and Inclusion Dependencies is Undecidable , 1985, SIAM J. Comput..

[47]  Andrea Calì,et al.  Querying incomplete data over extended ER schemata , 2010, Theory and Practice of Logic Programming.

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

[49]  Riccardo Rosati,et al.  On Conjunctive Query Answering in EL , 2007, Description Logics.

[50]  Maurizio Lenzerini,et al.  Mastro at Work: Experiences on Ontology-Based Data Access , 2010, Description Logics.

[51]  Georg Gottlob,et al.  Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width , 2001, PODS '01.

[52]  Diego Calvanese,et al.  Description Logics for Information Integration , 2002, Computational Logic: Logic Programming and Beyond.

[53]  Luca Cabibbo,et al.  The Expressive Power of Stratified Logic Programs with Value Invention , 1998, Inf. Comput..

[54]  Andrea Calì,et al.  On the decidability and complexity of query answering over inconsistent and incomplete databases , 2003, PODS.

[55]  Carsten Lutz,et al.  The Combined Approach to Query Answering in DL-Lite , 2010, KR.

[56]  Georg Gottlob,et al.  Hypertree decompositions and tractable queries , 1998, J. Comput. Syst. Sci..

[57]  Peter P. Chen.  The entity-relationship model: toward a unified view of data , 1975, VLDB '75.

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

[59]  Andrea Calì,et al.  A general Datalog-based framework for tractable query answering over ontologies , 2012, J. Web Semant..

[60]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[61]  Diego Calvanese,et al.  Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .

[62]  Thomas Eiter,et al.  \mathbbFDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols , 2007, LPAR.

[63]  David Maier,et al.  Testing implications of data dependencies , 1979, SIGMOD '79.

[64]  Andrea Calì,et al.  Accessing Data Integration Systems through Conceptual Schemas , 2001, ER.