Logical queries over views: Decidability and expressiveness

ACM Transactions on Computational Logic

Volumn 11, Issue 2, 2010, Pages

  Bailey, James ^a   Dong, Guozhu ^b   To, Anthony Widjaja ^c  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b WRIGHT STATE UNIVERSITY   (United States)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Conjunctive query; Containment; Database query; Database view; Decidability; First order logic; L wenheim class; Monadic logic; Ontology reasoning; Satisfiability; Unary logic; Unary view

Indexed keywords

CONJUNCTIVE-QUERY CONTAINMENT; DATABASE QUERIES; DATABASE VIEWS; DECIDABILITY; FIRST ORDER LOGIC; MONADIC LOGIC; SATISFIABILITY;

AUTOMATA THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA WAREHOUSES; ONTOLOGY; QUERY LANGUAGES;

COMPUTABILITY AND DECIDABILITY;

EID: 76249106397     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1656242.1656243     Document Type: Article

References (30)

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. AMathematical Introduction To Logic.AHarcourt 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-101, 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.