Decidability of first-order logic queries over views

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1540, Issue , 1998, Pages 83-99

  Bailey, James ^a   Dong, Guozhu ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Conjunctive queries; Database queries; Database views; Decidability; First order logic; Inequality; Satisfiability; The L wenheim class; Unary views

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DATA DESCRIPTION; DATA WAREHOUSES; DATABASE SYSTEMS; QUERY LANGUAGES; QUERY PROCESSING;

CONJUNCTIVE QUERIES; DATABASE QUERIES; DATABASE VIEWS; FIRST ORDER LOGIC; INEQUALITY; SATISFIABILITY; UNARY VIEWS;

FORMAL LOGIC;

EID: 84947264338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (12)

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.
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.
3. E. Boerger, E. Graedel, and Y. Gurevich. The Classical Decision Problem.Springer-Verlag, 1996.
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.
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.
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.
7. N. Immerman. Upper and lower bounds for first-order expressibility. Journal of Computer and System Sciences, 25:76-98, 1982.
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.
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.
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.
11. D. Theodoratos. Deductive object oriented schemas. In Proceedings of ER’96, 15th International Conference on Conceptual Modeling, pages 58-72, 1996.
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.