Monadic Datalog Containment

We reconsider the problem of containment of monadic datalog (MDL) queries in unions of conjunctive queries (UCQs). Prior work has dealt with special cases, but has left the precise complexity characterization open. We begin by establishing a 2EXPTIME lower bound on the MDL/UCQ containment problem, resolving an open problem from the early 90's. We then present a general approach for getting tighter bounds on the complexity, based on analysis of the number of mappings of queries into tree-like instances. We use the machinery to present an important case of the MDL/UCQ containment problem that is in co-NEXPTIME, and a case that is in EXPTIME. We then show that the technique can be used to get a new tight upper bound for containment of tree automata in UCQs. We show that the new MDL/UCQ upper bounds are tight.

[1]  Surajit Chaudhuri,et al.  On the equivalence of recursive and nonrecursive datalog programs , 1992, J. Comput. Syst. Sci..

[2]  Diego Calvanese,et al.  Containment of Conjunctive Regular Path Queries with Inverse , 2000, KR.

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

[4]  Thomas Schwentick,et al.  Optimizing Conjunctive Queries over Trees Using Schema Information , 2008, MFCS.

[5]  Edward Y. Chang,et al.  Answering queries with useful bindings , 2001, TODS.

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

[7]  Diego Calvanese,et al.  Decidable Containment of Recursive Queries , 2003, ICDT.

[8]  Christian S. Jensen,et al.  Capturing Temporal Constraints in Temporal ER Models , 2008, ER.

[9]  Piero A. Bonatti,et al.  On the decidability of containment of recursive datalog queries - preliminary report , 2004, PODS '04.

[10]  Georg Gottlob,et al.  Determining relevance of accesses at runtime , 2011, PODS.

[11]  Bruno Courcelle,et al.  Recursive Queries and Context-free Graph Grammars , 1991, Theor. Comput. Sci..

[12]  Jeffrey D. Ullman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS '95.

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

[14]  Balder ten Cate,et al.  Unary negation , 2011, STACS.

[15]  Anand Rajaraman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS.

[16]  Andrea Calì,et al.  Querying the deep web , 2010, EDBT '10.

[17]  Michael Benedikt,et al.  Querying Schemas With Access Restrictions , 2012, Proc. VLDB Endow..

[18]  Andrea Calì,et al.  Conjunctive Query Containment under Access Limitations , 2008, ER.

[19]  Jerzy Tyszkiewicz,et al.  Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings , 2008, MFCS.

[20]  Thomas Schwentick,et al.  Validity of Tree Pattern Queries with Respect to Schema Information , 2013, MFCS.