On Monotonic Determinacy and Rewritability for Recursive Queries and Views

A query Q is monotonically determined over a set of views if Q can be expressed as a monotonic function of the view image. In the case of relational algebra views and queries, monotonic determinacy coincides with rewritability as a union of conjunctive queries, and it is decidable in important special cases, such as for CQ views and queries. We investigate the situation for views and queries in the recursive query language Datalog. We give both positive and negative results about the ability to decide monotonic determinacy, and also about the co-incidence of monotonic determinacy with Datalog rewritability.

[1]  Vasilis Vassalos,et al.  Answering Queries Using Views , 2009, Encyclopedia of Database Systems.

[2]  Jerzy Marcinkowski,et al.  The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[3]  Oded Shmueli,et al.  Equivalence of DATALOG Queries is Undecidable , 1993, J. Log. Program..

[4]  Mihalis Yannakakis,et al.  Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

[5]  Carsten Lutz,et al.  Query Expressibility and Verification in Ontology-Based Data Access , 2020, KR.

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

[7]  Phokion G. Kolaitis,et al.  On the expressive power of datalog: tools and a case study , 1990, J. Comput. Syst. Sci..

[8]  Andrei A. Bulatov,et al.  On the Power of k -Consistency , 2007, ICALP.

[9]  Michael Benedikt,et al.  Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation , 2016, Synthesis Lectures on Data Management.

[10]  Cristina Sirangelo,et al.  Datalog Rewritings of Regular Path Queries using Views , 2014, ICDT.

[11]  Foto N. Afrati,et al.  Determinacy and query rewriting for conjunctive queries and views , 2011, Theor. Comput. Sci..

[12]  Alon Y. Halevy,et al.  Recursive Query Plans for Data Integration , 2000, J. Log. Program..

[13]  Phokion G. Kolaitis,et al.  Constraint Propagation as a Proof System , 2004, CP.

[14]  Diego Calvanese,et al.  Lossless regular views , 2002, PODS.

[15]  Jerzy Marcinkowski,et al.  Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable , 2016, PODS.

[16]  Surajit Chaudhuri,et al.  On the complexity of equivalence between recursive and nonrecursive Datalog programs , 1994, PODS '94.

[17]  Haim Gaifman,et al.  Decidable optimization problems for database logic programs , 1988, STOC '88.

[18]  Divesh Srivastava,et al.  Answering Queries Using Views. , 1999, PODS 1995.

[19]  Surajit Chaudhuri,et al.  On the Equivalence of Recursive and Nonrecursive Datalog Programs , 1997, J. Comput. Syst. Sci..

[20]  Balder ten Cate,et al.  Guarded Negation , 2011, Advances in Modal Logic.

[21]  Georg Gottlob,et al.  Monadic Datalog, Tree Validity, and Limited Access Containment , 2020, ACM Trans. Comput. Log..

[22]  Victor Vianu,et al.  Views and queries: Determinacy and rewriting , 2010, TODS.

[23]  Piotr Ostropolski-Nalewaja,et al.  Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable , 2018, LICS.

[24]  Martin Otto,et al.  Back and forth between guarded and modal logics , 2002, TOCL.

[25]  Michael Benedikt,et al.  Definability and Interpolation within Decidable Fixpoint Logics , 2019, Log. Methods Comput. Sci..