On the finite controllability of conjunctive query answering in databases under open-world assumption

Journal of Computer and System Sciences

Volumn 77, Issue 3, 2011, Pages 572-594

  Rosati, Riccardo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Finite controllability; Incomplete databases; Integrity constraints; Open world assumption; Query answering

Indexed keywords

CONTROLLABILITY; DATA INTEGRATION; ELECTRONIC DATA INTERCHANGE; INFORMATION MANAGEMENT; INTEGRATED CIRCUITS; ONTOLOGY; QUERY LANGUAGES;

FUNCTIONAL DEPENDENCY; INCLUSION DEPENDENCIES; INCOMPLETE INFORMATION; INTEGRITY CONSTRAINTS; ONTOLOGY-BASED INFORMATION SYSTEMS; OPEN WORLD ASSUMPTION; PEER DATA MANAGEMENT SYSTEMS; QUERY ANSWERING;

QUERY PROCESSING;

EID: 79952360524     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.04.011     Document Type: Article

References (37)

1. M.Y. Vardi, The implication and finite implication problems for typed template dependencies, in: Proceedings of the First ACM SIGACT SIGMOD Symposium on Principles of Database Systems (PODS'82), 1982, pp. 230-238.
2. M.H. Graham, A.O. Meldelzon, and M.Y. Vardi Notions of dependency satisfaction J. ACM 33 1 1986 105 129
3. R. van der Meyden Logical approaches to incomplete information J. Chomicki, G. Saake, Logics for Databases and Information Systems 1998 Kluwer Academic Publishers 307 356
4. C. Beeri, and M.Y. Vardi Formal systems for tuple and equality generating dependencies SIAM J. Comput. 13 1 1984 76 98 (Pubitemid 15494574)
5. D.S. Johnson, and A.C. Klug Testing containment of conjunctive queries under functional and inclusion dependencies J. Comput. System Sci. 28 1 1984 167 189 (Pubitemid 14569352)
6. M. Lenzerini, Data integration: A theoretical perspective, in: Proceedings of the Twenty-First ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2002), 2002, pp. 233-246. (Pubitemid 35009497)
7. R. Fagin, P.G. Kolaitis, L. Popa, Data exchange: Getting to the core, in: Proceedings of the Twenty-Second ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2003), 2003, pp. 90-101.
8. A.Y. Halevy Answering queries using views: A survey Very Large Database J. 10 4 2001 270 294 (Pubitemid 33570969)
9. U. Hustadt, B. Motik, U. Sattler, Data complexity of reasoning in very expressive description logics, in: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), 2005.
10. R. Fagin, P.G. Kolaitis, L. Popa, W.-C. Tan, Composing schema mappings: Second-order dependencies to the rescue, in: Proceedings of the Twenty-Third ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2004), 2004.
11. M. Arenas, L.E. Bertossi, J. Chomicki, Consistent query answers in inconsistent databases, in: Proceedings of the Eighteenth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS'99), 1999, pp. 68-79.
12. A. Halevy, Z. Ives, D. Suciu, I. Tatarinov, Schema mediation in peer data management systems, in: Proceedings of the Nineteenth IEEE International Conference on Data Engineering (ICDE 2003), 2003, pp. 505-516.
13. R. Rosati, On the decidability and finite controllability of query processing in databases with incomplete information, in: Proceedings of the Twenty-Fifth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2006), 2006, pp. 356-365. (Pubitemid 46946498)
14. S. Abiteboul, R. Hull, and V. Vianu Foundations of Databases 1995 Addison-Wesley Publ. Co.
15. M.Y. Vardi, On the integrity of databases with incomplete information, in: Proceedings of the First ACM SIGACT SIGMOD Symposium on Principles of Database Systems (PODS'82), 1982, pp. 252-266.
16. A. Calì, D. Lembo, R. Rosati, On the decidability and complexity of query answering over inconsistent and incomplete databases, in: Proceedings of the Twenty-Second ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2003), 2003, pp. 260-271.
17. M.A. Casanova, R. Fagin, and C.H. Papadimitriou Inclusion dependencies and their interaction with functional dependencies J. Comput. System Sci. 28 1 1984 29 59 (Pubitemid 14569358)
18. J.C. Mitchell The implication problem for functional and inclusion dependencies Inform. Control 56 1983 154 173
19. A.K. Chandra, and M.Y. Vardi The implication problem for functional and inclusion dependencies is undecidable SIAM J. Comput. 14 3 1985 671 677
20. J. Bailey, G. Dong, K. Ramamohanarao, Decidability and undecidability results for the termination problem of active database rules, in: Proceedings of the Seventeenth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS'98), 1998, pp. 264-273.
21. J. Bailey, G. Dong, Decidability of first-order logic queries over views, in: Proceedings of the Seventh International Conference on Database Theory (ICDT'99), 1999, pp. 83-99.
22. S. Abiteboul, O. Duschka, Complexity of answering queries using materialized views, in: Proceedings of the Seventeenth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS'98), 1998, pp. 254-265.
23. O.M. Duschka, M.R. Genesereth, and A.Y. Levy Recursive query plans for data integration J. Log. Program. 43 1 2000 49 73 (Pubitemid 32213484)
24. C. Beeri, and M.Y. Vardi A proof procedure for data dependencies J. ACM 31 4 1984 718 741
25. X. Zhang, and Z.M. Ozsoyoglu Implication and referential constraints: A new formal reasoning IEEE Trans. Knowledge Data Engrg. 9 6 1997 894 910
26. G. Dong, and J. Su Conjunctive query containment with respect to views and constraints Inform. Process. Lett. 57 2 1996 95 102 (Pubitemid 126367664)
27. R. van der Meyden, The complexity of querying indefinite information, PhD thesis, Rutgers University, 1992.
28. R. van der Meyden The complexity of querying indefinite data about linearly ordered domains J. Comput. System Sci. 54 1 1997 113 135 (Pubitemid 127437200)
29. A.C. Klug On conjunctive queries containing inequalities J. ACM 35 1 1988 146 160
30. R. Fagin, P.G. Kolaitis, R.J. Miller, L. Popa, Data exchange: Semantics and query answering, in: Proceedings of the Ninth International Conference on Database Theory (ICDT 2003), 2003, pp. 207-224.
31. A. Calì, G. Gottlob, M. Kifer, Taming the infinite chase: Query answering under expressive relational constraints, in: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), 2008.
32. A. Deutsch, A. Nash, J.B. Remmel, The chase revisited, in: Proceedings of the Twenty-Seventh ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2008), 2008, pp. 149-158.
33. S.S. Cosmadakis, P.C. Kanellakis, and M. Vardi Polynomial-time implication problems for unary inclusion dependencies J. ACM 37 1 1990 15 46 (Pubitemid 20673335)
34. M. Levene, and G. Loizou How to prevent interaction of functional and inclusion dependencies Inform. Process. Lett. 71 4 1999 115 125 (Pubitemid 30509833)
35. W. Fan, J. Siméon, Integrity constraints for XML, in: Proceedings of the Nineteenth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2000), 2000, pp. 23-34.
36. W. Fan, and L. Libkin On XML integrity constraints in the presence of DTDs J. ACM 49 3 2002 368 406
37. R. Rosati The limits of querying ontologies Proceedings of the Eleventh International Conference on Database Theory ICDT 2007 Lecture Notes in Comput. Sci. vol. 4353 2007 Springer 164 178