Abstract
We show that all–instances termination of chase is undecidable. More precisely, there is no algorithm deciding, for a given set \(\cal T\) consisting of Tuple Generating Dependencies (a.k.a. Datalog ∃ program), whether the \(\cal T\)-chase on D will terminate for every finite database instance D. Our method applies to Oblivious Chase, Semi-Oblivious Chase and – after a slight modification – also for Standard Chase. This means that we give a (negative) solution to the all–instances termination problem for all version of chase that are usually considered.
The arity we need for our undecidability proof is three. We also show that the problem is EXPSPACE-hard for binary signatures, but decidability for this case is left open.
Both the proofs – for ternary and binary signatures – are easy. Once you know them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aho, A.V., Sagiv, Y., Ullman, J.D.: Efficient Optimization of a Class of Relational Expressions. ACM Transactions on Database Systems 4(4), 435–454 (1979)
Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. Journal of the ACM (JACM) 31(4), 718–741 (1984)
Calı, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. of KR, pp. 70–80 (2008)
Calı, A., Gottlob, G., Lukasiewicz, T.: Datalog +/-: A unified approach to ontologies and integrity constraints. In: Proceedings of the 12th International Conference on Database Theory. ACM (2009)
Calı, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. Web Semantics: Science, Services and Agents on the World Wide Web 14, 57–83 (2012)
Deutsch, A., Tannen, V.: Reformulation of XML Queries and Constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 225–238. Springer, Heidelberg (2002)
Deutsch, A., Nash, A., Remmel, J.: The chase revisited. In: Proceedings of the 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM (2008)
Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theoretical Computer Science 336(1), 89–124 (2005)
Greco, S., Spezzano, F.: Chase termination: A constraints rewriting approach. Proceedings of the VLDB Endowment 3(1-2), 93–104 (2010)
Gaifman, H., Mairson, H., Sagiv, Y., Vardi, M.Y.: Undecidable optimization problems for database logic programs. Journal of the ACM 40(3), 683–713 (1993)
Grahne, G., Onet, A.: On Conditional Chase Termination. AMW 11, 46 (2011)
Grahne, G., Onet, A.: Anatomy of the chase. arXiv:1303.6682 (2013)
Hernich, A., Schweikardt, N.: CWA-solutions for data exchange settings with target dependencies. In: Proceedings of the Twenty-sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM (2007)
Marcinkowski, J.: Achilles, turtle, and undecidable boundedness problems for small DATALOG programs. SIAM Journal on Computing 29(1), 231–257 (1999)
Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Transactions on Database Systems 4(4), 455–469 (1979)
Marnette, B.: Generalized schema-mappings: from termination to tractability. In: Proceedings of the Twenty-eighth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM (2009)
Meier, M., Schmidt, M., Lausen, G.: On chase termination beyond stratification. Proceedings of the VLDB Endowment 2(1), 970–981 (2009)
Meier, M., Schmidt, M., Lausen, G.: On chase termination beyond stratification (technical report and erratum), http://arxiv.org/abs/0906.4228
Onet, A.: The chase procedure and its applications in data exchange. In: Data Exchange, Integration, and Streams. Dagstuhl Follow-Ups. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Germany (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gogacz, T., Marcinkowski, J. (2014). All–Instances Termination of Chase is Undecidable. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43951-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-662-43951-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43950-0
Online ISBN: 978-3-662-43951-7
eBook Packages: Computer ScienceComputer Science (R0)