On the decidability and finite controllability of query processing in databases with incomplete information

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 356-365

  Rosati, Riccardo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CONTROLLABILITY; DATABASE SYSTEMS; ELECTRONIC DATA INTERCHANGE; INFORMATION SYSTEMS;

DATA INTEGRATION; FINITE CONTROLLABILITY; INFORMATION ACCESS;

QUERY PROCESSING;

EID: 34250652540     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142404     Document Type: Conference Paper

References (37)

1. S. Abiteboul and O. Duschka. Complexity of answering queries using materialized views. In Proc. of PODS'98, pages 254-265, 1998.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley Publ. Co., 1995.
3. M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In Proc. of PODS'99, pages 68-79, 1999.
4. J. Bailey and G. Dong. Decidability of first-order logic queries over views. In Proc. of ICDT'99, pages 83-99, 1999.
5. J. Bailey, G. Dong, and K. Ramamohanarao. Decidability and undecidability results for the termination problem of active database rules. In Proc. of PODS'98, pages 264-273, 1998.
6. C. Beeri and M. Y. Vardi. The implication problem for data dependencies. In Proc. of IC ALP '81, pages 73-85, 1981.
7. C. Beeri and M. Y. Vardi. Formal systems for tuple and equality generating dependencies. SIAM J. on Computing, 13(1):76-98, 1984.
8. C. Beeri and M. Y. Vardi. A proof procedure for data dependencies. J. of the ACM, 31(4):718-741, 1984.
9. A. Call, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proc. of PODS 2003, pages 260-271, 2003.
10. D. Calvanese and R. Rosati. Answering recursive queries under keys and foreign keys is undecidable. In Proc. of KRDB 2003. CEUR. Electronic Workshop Proceedings, http://ceur-ws.org/Vol-79/, 2003.
11. M. A. Casanova, R. Fagin, and C. H. Papadimitriou. Inclusion dependencies and their interaction with functional dependencies. J. of Computer and System Sciences, 28(1):29-59, 1984.
12. A. K. Chandra and M. Y. Vardi. The implication problem for functional and inclusion dependencies is undecidable. SIAM J. on Computing, 14(3):671-677, 1985.
13. S. S. Cosmadakis, P. C. Kanellakis, and M. Vardi. Polynomial-time implication problems for unary inclusion dependencies. J. of the ACM, 37(1):15-46, Jan. 1990.
14. G. Dong and J. Su. Conjunctive query containment with respect to views and constraints. Information Processing Letters, 57(2):95-102, 1996.
15. O. M. Duschka, M. R,. Genesereth, and A. Y. Levy. Recursive query plans for data integration. J. of Logic Programming, 43(1):49-73, 2000.
16. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. In Proc. of ICDT 2009, pages 207-224, 2003.
17. R. Fagin, P. G. Kolaitis, and L. Popa. Data exchange: Getting to the core. In Proc. of PODS 2003, pages 90-101, 2003.
18. R. Fagin, P. G. Kolaitis, L. Popa, and W.-C. Tan. Composing schema mappings: Second-order dependencies to the rescue. In Proc. of PODS 2004, 2004.
19. W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. J. of the ACM, 49(3):368-406, 2002.
20. W. Fan and J. Siméon. Integrity constraints for XML. In Proc. of PODS 2000, pages 23-34, 2000.
21. M. H. Graham, A. O. Meldelzon, and M. Y. Vardi. Notions of dependency satisfaction. J. of the ACM, 33(1):105-129, 1986.
22. A. Halevy, Z. Ives, D. Suciu, and I. Tatarinov. Schema mediation in peer data management systems. In Proc. of ICDE 2003, pages 505-516, 2003.
23. A. Y. Halevy. Answering queries using views: A survey. VLDB Journal, 10(4):270-294, 2001.
24. A. Y. Halevy, I. S. Mumick, Y. Sagiv, and O. Shmueli. Static analysis in Datalog extensions. J. of the ACM, 48(5):971-1012, 2001.
25. U. Hustadt, B. Motik, and U. Sattler. Data complexity of reasoning in very expressive description logics. In Proc. of IJCAI 2005, 2005.
26. D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. of Computer and System Sciences, 28(1):167-189, 1984.
27. A. C. Klug. On conjunctive queries containing inequalities. J. of the ACM, 35(1): 146-160, 1988.
28. M. Lenzerini. Data integration: A theoretical perspective. In Proc. of PODS 2002, pages 233-246, 2002.
29. M. Levene and G. Loizou. How to prevent interaction of functional and inclusion dependencies. Information Processing Letters, 71(4):115-125, 1999.
30. J. C. Mitchell. The implication problem for functional and inclusion dependencies. Information and Control, 56:154-173, 1983.
31. B. Trahktenbrot. Impossibility of an algorithm for the decision problem in finite classes. Transactions of the American Mathematical Society, 3:1-5, 1963.
32. R. van der Meyden. The Complexity of Querying Indefinite Information. PhD thesis, Rutgers University, 1992.
33. R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. J. of Computer and System Sciences, 54(1):113-135, 1997.
34. R. van der Meyden. Logical approaches to incomplete information. In J. Chomicki and G. Saake, editors, Logics for Databases and Information Systems, pages 307-356. Kluwer Academic Publisher, 1998.
35. M. Y. Vardi. The implication and finite implication problems for typed template dependencies. In Proc. of PODS'82, pages 230-238, 1982.
36. M. Y. Vardi. On the integrity of databases with incomplete information. In Proc. of PODS'82, pages 252-266, 1982.
37. X. Zhang and Z. M. Ozsoyoglu. Implication and referential constraints: A new formal reasoning. IEEE Trans. on Knowledge and Data Engineering, 9(6):894-910, 1997.