Logical queries over views: Decidability and expressiveness
Article No.: 8, Pages 1 - 35
Abstract
We study the problem of deciding the satisfiability of first-order logic queries over views, with our aim to delimit the boundary between the decidable and the undecidable fragments of this language. Views currently occupy a central place in database research due to their role in applications such as information integration and data warehousing. Our main result is the identification of a decidable class of first-order queries over unary conjunctive views that generalizes the decidability of the classical class of first-order sentences over unary relations known as the Löwenheim class. We then demonstrate how various extensions of this class lead to undecidability and also provide some expressivity results. Besides its theoretical interest, our new decidable class is potentially interesting for use in applications such as deciding implication of complex dependencies, analysis of a restricted class of active database rules, and ontology reasoning.
References
[1]
Abiteboul, S. and Duschka, O. 1998. Complexity of answering queries using materialized views. In Proceedings of the 17th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM, 254--263.
[2]
Abiteboul, S., Hull, R., and Vianu, V. 1995. Foundations of Databases. Addison-Wesley Longman Publishing Co., Inc.
[3]
Andreka, H., van Bentham, J., and Nemeti, I. 1998. Modal logics and bounded fragments of predicate logics. J. Philosophical Logic 27, 217--274.
[4]
Baader, F., Calvanese, D., McGuinness, D. L., Nardi, D., and Patel-Schneider, P. F. 2003. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press.
[5]
Bailey, J. and Dong, G. 1999. Decidability of first-order logic queries over views. In Proceedings of the International Conference on Database Theory (ICDT). Springer, 83--99.
[6]
Bailey, J., Dong, G., and Ramamohanarao, K. 1998. Decidability and undecidability results for the termination problem of active database rules. In Proceedings of the 17th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM, 264--273.
[7]
Bollobas, B. 2004. Extremal Graph Theory. Dover Publications.
[8]
Boolos, G. S., Burgess, J. P., and Jeffrey, R. C. 2002. Computability and Logic. Cambridge University Press.
[9]
Börger, E., Grädel, E., and Gurevich, Y. 1997. The Classical Decision Problem. Springer-Verlag.
[10]
Calvanese, D., De Giacomo, G., and Lenzerini, M. 1998. On the decidability of query containment under constraints. In Proceedings of the 17th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM, 149--158.
[11]
Cosmadakis, S., Kanellakis, P., and Vardi, M. 1990. Polynomial time implication problems for unary inclusion dependencies. J. ACM 37, 1, 15--46.
[12]
Diestel, R. 2005. Graph Theory. Springer-Verlag.
[13]
Enderton, H. B. 2001. A Mathematical Introduction To Logic. A Harcourt Science and Technology Company.
[14]
Gaifman, H. 1982. On local and nonlocal properties. In Procedings of the Logic Colloquium. J. Stern, Ed. North Holland, 105--135.
[15]
Garcia-Molina, H., Quass, D., Papakonstantinou, Y., Rajaraman, A., and Sagiv, Y. 1995. The TSIMMIS approach to mediation: Data models and language. In Proceedings of the 2nd International Workshop on Next Generation Information Technologies and Systems.
[16]
Halevy, A. Y. 2001. Answering queries using views: A survey. VLDB J. 10, 4, 270--294.
[17]
Hodges, W. 1997. A Shorter Model Theory. Cambridge University Press.
[18]
Hodkinson, I. M. 2002. Loosely guarded fragment of first-order logic has the finite model property. Studia Logica 70, 2, 205--240.
[19]
Horrocks, I. 2005. Applications of description logics: State of the art and research challenges. In Proceedings of 13th International Conference on Conceptual Structures (ICCS). 78--90.
[20]
Horrocks, I., Patel-Schneider, P. F., and van Harmelen, F. 2003. From SHIQ and RDF to OWL: the making of a web ontology language. J. Web Seman. 1, 1, 7--26.
[21]
Levy, A., Mumick, I. S., Sagiv, Y., and Shmueli, O. 1993. Equivalence, query reachability, and satisfiability in datalog extensions. In Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 109--122.
[22]
Levy, A., Rajaraman, A., and Ordille, J. 1996. Querying heterogeneous information sources using source descriptions. In Proceedings of 22th International Conference on Very Large Data Bases. 251--262.
[23]
Libkin, L. 2004. Elements of Finite Model Theory. Springer-Verlag.
[24]
Löwenheim, L. 1915. Über möglichkeiten im relativkalkul. Math. Annalen 76, 447--470.
[25]
Nash, A., Segoufin, L., and Vianu, V. 2007. Determinacy and rewriting of conjunctive queries using views: A progress report. In Proceedings of the International Conference on Database Theory. 59--73.
[26]
Sagiv, Y. and Yannakakis, M. 1980. Equivalences among relational expressions with the union and difference operators. J. ACM 27, 4, 633--655.
[27]
Theodoratos, D. 1996. Deductive object oriented schemas. In Proceedings of the 15th International Conference on Conceptual Modeling. Springer, 58--72.
[28]
Ullman, J. D. 1997. Information integration using logical views. In Proceedings of the 6th International Conference on Database Theory, Lecture Notes in Computer Science, vol. 1186. Springer, 19--40.
[29]
Van Bentham, J. 1997. Dynamic bits and pieces. Tech. rep. ILLC Research Report LP-97-01, University of Amsterdam.
[30]
Widom, J. 1995. Research problems in data warehousing. In Proceedings of the 4th International Conference on Information and Knowledge Management. ACM, 25--30.
Index Terms
- Logical queries over views: Decidability and expressiveness
Recommendations
Guarded Negation
We consider restrictions of first-order logic and of fixpoint logic in which all occurrences of negation are required to be guarded by an atomic predicate. In terms of expressive power, the logics in question, called GNFO and GNFP, extend the guarded ...
First-order satisfiability in Gödel logics: An NP-complete fragment
Defined over sets of truth values V which are closed subsets of [0,1] containing both 0 and 1, Godel logics G"V are prominent examples of many-valued logics. We investigate a first-order fragment of G"V extended with @D, that is powerful enough to ...
First-order logic as a constraint satisfaction problem
AbstractIn this paper, we discourse an analysis of classical first-order predicate logic as a constraint satisfaction problem, CSP. First, we will offer our general framework for CSPs, and then apply it to first-order logic. We claim it would function as ...
Comments
Information & Contributors
Information
Published In
Copyright © 2010 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 22 January 2010
Accepted: 01 October 2008
Received: 01 March 2008
Published in TOCL Volume 11, Issue 2
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 387Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)0
Reflects downloads up to 02 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in