Leveraging Equality Generating Dependencies for Chase Termination

Tupleand equality-generating dependencies have a wide range of applications in knowledge representation and databases, including ontological reasoning, data exchange, and data cleaning. In such settings, the chase is a central tool for many reasoning tasks. Since the chase evaluation might not terminate and it is undecidable whether it terminates, several termination criteria have been proposed, that is, (decidable) sufficient conditions ensuring termination. One of the main weaknesses of current approaches is the limited analysis they perform on equality-generating dependencies (EGDs). In this paper, we show that an explicit analysis of EGDs can yield significant benefits and discuss a novel approach along this line.

[1]  Georg Gottlob,et al.  Efficient core computation in data exchange , 2008, JACM.

[2]  Marco Calautti,et al.  Using linear constraints for logic program termination analysis , 2015, Theory and Practice of Logic Programming.

[3]  Marco Calautti,et al.  Logic Program Termination Analysis Using Atom Sizes , 2015, IJCAI.

[4]  Wenfei Fan,et al.  Conditional functional dependencies for capturing data inconsistencies , 2008, TODS.

[5]  Marco Calautti,et al.  Checking Termination of Logic Programs with Function Symbols through Linear Constraints , 2014, RuleML.

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

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

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

[9]  M. Tamer Özsu.  Synthesis Lectures on Data Management , 2010 .

[10]  Sergio Greco,et al.  Chase termination , 2010, Proc. VLDB Endow..

[11]  Sergio Greco,et al.  Feasibility Conditions and Preference Criteria in Querying and Repairing Inconsistent Databases , 2004, DEXA.

[12]  Marco Calautti,et al.  Checking Termination of Bottom-Up Evaluation of Logic Programs with Function Symbols , 2015, Theory Pract. Log. Program..

[13]  Catriel Beeri,et al.  A Proof Procedure for Data Dependencies , 1984, JACM.

[14]  Sergio Greco,et al.  Incomplete Data and Data Dependencies in Relational Databases , 2012, Incomplete Data and Data Dependencies in Relational Databases.

[15]  Sergio Greco,et al.  Optimization of bound disjunctive queries with constraints , 2004, Theory and Practice of Logic Programming.

[16]  Catriel Beeri,et al.  Formal Systems for Tuple and Equality Generating Dependencies , 1984, SIAM J. Comput..

[17]  Ronald Fagin,et al.  Locally consistent transformations and query answering in data exchange , 2004, PODS '04.

[18]  Sergio Greco,et al.  Checking Chase Termination: Cyclicity Analysis and Rewriting Techniques , 2015, IEEE Transactions on Knowledge and Data Engineering.

[19]  Sergio Greco,et al.  Stratification criteria and rewriting techniques for checking chase termination , 2011, Proc. VLDB Endow..

[20]  Sergio Greco,et al.  atalog: A logic language for expressing search and optimization problems , 2009, Theory and Practice of Logic Programming.

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

[22]  Laks V. S. Lakshmanan,et al.  Data Cleaning and Query Answering with Matching Dependencies and Matching Functions , 2010, ICDT '11.

[23]  Maurizio Lenzerini,et al.  On reconciling data exchange, data integration, and peer data management , 2007, PODS '07.

[24]  Sergio Greco,et al.  Datalog and Logic Databases , 2015, Synthesis Lectures on Data Management.

[25]  Marco Calautti,et al.  Exploiting Equality Generating Dependencies in Checking Chase Termination , 2016, Proc. VLDB Endow..

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

[27]  Jerzy Marcinkowski,et al.  All-Instances Termination of Chase is Undecidable , 2014, ICALP.

[28]  Andrea Calì,et al.  Advanced processing for ontological queries , 2010, Proc. VLDB Endow..

[29]  Paolo Papotti,et al.  The LLUNATIC Data-Cleaning Framework , 2013, Proc. VLDB Endow..

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

[31]  Boris Motik,et al.  Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies , 2013, J. Artif. Intell. Res..

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

[33]  Ronald Fagin.  Equality-Generating Dependencies , 2009, Encyclopedia of Database Systems.

[34]  Marco Calautti,et al.  Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols , 2017, ACM Trans. Comput. Log..

[35]  Sergio Greco,et al.  Bounded Programs: A New Decidable Class of Logic Programs with Function Symbols , 2013, IJCAI.

[36]  Georg Lausen,et al.  On Chase Termination Beyond Stratification , 2009, Proc. VLDB Endow..

[37]  Adrian Onet,et al.  The Chase Procedure and its Applications in Data Exchange , 2013, Data Exchange, Information, and Streams.

[38]  Sergio Greco,et al.  Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments , 2013, Theory and Practice of Logic Programming.

[39]  Georg Gottlob,et al.  Chase Termination for Guarded Existential Rules , 2015, AMW.