Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Shmueli, O.: Equivalence of datalog queries is undecidable. J. Log. Prog. 15(3) (1993)
Bonatti, P.A.: On the decidability of containment of recursive datalog queries. In: PODS (2004)
Calvanese, D., De Giacomo, G., Vardi, M.Y.: Decidable containment of recursive queries. Theoretical Computer Science 336(1) (2005)
Chaudhuri, S., Vardi, M.Y.: On the equivalence of recursive and nonrecursive Datalog programs. In: PODS (1992)
Chaudhuri, S., Vardi, M.Y.: On the equivalence of recursive and nonrecursive Datalog programs. JCSS 54(1) (1997)
Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs. In: STOC (1988)
Chaudhuri, S., Vardi, M.Y.: On the complexity of equivalence between recursive and nonrecursive Datalog programs. In: PODS (1994)
Calì, A., Martinenghi, D.: Conjunctive Query Containment under Access Limitations. In: Li, Q., Spaccapietra, S., Yu, E., Olivé, A. (eds.) ER 2008. LNCS, vol. 5231, pp. 326–340. Springer, Heidelberg (2008)
Benedikt, M., Gottlob, G., Senellart, P.: Determining relevance of accesses at runtime. In: PODS (2011)
Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: KR (2000)
Courcelle, B.: Recursive queries and context-free graph grammars. Theoretical Computer Science 78(1) (1991)
ten Cate, B., Segoufin, L.: Unary negation. In: STACS (2011)
Benedikt, M., Bourhis, P., Ley, C.: Querying schemas with access paths. PVLDB (2012)
Björklund, H., Martens, W., Schwentick, T.: Optimizing Conjunctive Queries over Trees Using Schema Information. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 132–143. Springer, Heidelberg (2008)
Rajaraman, A., Sagiv, Y., Ullman, J.D.: Answering queries using templates with binding patterns. In: PODS (1995)
Li, C., Chang, E.Y.: Answering queries with useful bindings. ACM TODS 26(3) (2001)
Calì, A., Martinenghi, D.: Querying the deep web. In: EDBT (2010)
Björklund, H., Martens, W., Schwentick, T.: Validity of tree pattern queries with respect to schema information (2012) (unpublished draft)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benedikt, M., Bourhis, P., Senellart, P. (2012). Monadic Datalog Containment. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31585-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-31585-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31584-8
Online ISBN: 978-3-642-31585-5
eBook Packages: Computer ScienceComputer Science (R0)