Decidability of First-Order Logic Queries over Views

  • James Bailey
  • Guozhu Dong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1540)


We study the problem of deciding satisfiability of first order logic queries over views, our aim being 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 principal result is the identification of an important decidable class of queries over unary conjunctive views. This extends the decidability of the classical class of first order sentences over unary relations (the Löwenheim class). We then demonstrate how extending this class leads to undecidability. In addition to new areas, our work also has relevance to extensions of results for related problems such as query containment, trigger termination, implication of dependencies and reasoning in description logics.


satisfiability decidability first order logic database queries database views conjunctive queries unary views inequality the Löwenheim class 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Abiteboul and O. Duschka. Complexity of answering queries using materialized views. In Proceedings of the 17th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 254–263, Seattle, Washington, 1998.Google Scholar
  2. 2.
    J. Bailey, G. Dong, and K. Ramamohanarao. 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, pages 264–273, Seattle, Washington, 1998.Google Scholar
  3. 3.
    E. Boerger, E. Graedel, and Y. Gurevich. The Classical Decision Problem. Springer-Verlag, 1996.Google Scholar
  4. 4.
    D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proceedings of the 17th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 149–158, Seattle, Washington, 1998.Google Scholar
  5. 5.
    S. Cosmadakis, H. Gaifman, P. Kanellakis, and M. Vardi. Decidable optimization problems for database logic programs. Proceedings of the ACM Symposium on the Theory of Computing, pages 477–490 1988.Google Scholar
  6. 6.
    S. Cosmadakis, P. Kanellakis, and M. Vardi. Polynomial time implication problems for unary inclusion dependencies. Journal of the ACM, 37(1):15–46, 1990.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    N. Immerman. Upper and lower bounds for first-order expressibility. Journal of Computer and System Sciences, 25:76–98, 1982.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    A. Levy, I. S. Mumick, Y. Sagiv, and O. Shmueli. Equivalence, query reachability, and satisfiability in datalog extensions. In Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 109–122, Washington D.C., 1993.Google Scholar
  9. 9.
    A. Levy and M. Rousset. The limits on combining recursive horn rules with description logics. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), Portland, Oregon, 1996.Google Scholar
  10. 10.
    Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. Journal of the ACM, 27(4):633–655, 1980.MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    D. Theodoratos. Deductive object oriented schemas. In Proceedings of ER’96, 15th International Conference on Conceptual Modeling, pages 58–72 1996.Google Scholar
  12. 12.
    J. D. Ullman. Information integration using logical views. In Proceedings of the Sixth International Conference on Database Theory, LNCS 1186, pages 19–40, Delphi, Greece, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • James Bailey
    • 1
  • Guozhu Dong
    • 2
  1. 1.Department of Computer ScienceLondonUK
  2. 2.Department of Computer ScienceThe University of MelbourneParkvilleAustralia

Personalised recommendations