On the data complexity of consistent query answering

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 22-33

  Ten Cate, Balder ^a   Fontaine, Gaëlle ^a   Kolaitis, Phokion G ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Consistent answers; Constraints; Inconsistent databases; Repairs

Indexed keywords

CONJUNCTIVE QUERIES; CONSISTENT ANSWERS; CONSISTENT QUERY ANSWERING; CONSTRAINTS; DATA COMPLEXITY; DATA INTEGRATION; DATABASE REPAIRS; INCONSISTENT DATABASE; POLYNOMIAL TIME COMPUTABILITY; SYSTEMATIC INVESTIGATIONS; UNDECIDABILITY;

ELECTRONIC DATA INTERCHANGE; REPAIR; SEMANTICS;

DATABASE SYSTEMS;

EID: 84863923129     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2274576.2274580     Document Type: Conference Paper

References (29)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. F. N. Afrati and P. G. Kolaitis. Repair checking in inconsistent databases: algorithms and complexity. In ICDT, pages 31-41, 2009.
3. M. Arenas and L. E. Bertossi. On the decidability of consistent query answering. In AMW, 2010.
4. M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In PODS, pages 68-79, 1999.
5. M. Benedikt, W. Fan, and F. Geerts. XPath satisfiability in the presence of dtds. J. ACM, 55(2), 2008.
6. L. E. Bertossi. Consistent query answering in databases. SIGMOD Record, 35(2):68-76, 2006.
7. E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, 1997.
8. L. Bravo and L. E. Bertossi. Consistent query answering under inclusion dependencies. In CASCON, pages 202-216, 2004.
9. A. Calì, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In PODS, pages 260-271, 2003.
10. J. Chomicki. Consistent query answering: Five easy pieces. In ICDT, pages 1-17, 2007.
11. J. Chomicki and J. Marcinkowski. Minimal-change integrity maintenance using tuple deletions. Inf. Comput., 197(1-2):90-121, 2005.
12. A. Deutsch and V. Tannen. Reformulation of XML queries and constraints. In ICDT, pages 225-241, 2003.
13. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005.
14. R. Fagin, P. G. Kolaitis, and L. Popa. Data Exchange: Getting to the Core. TODS, 30(1):174-210, 2005.
15. A. Fuxman, P. G. Kolaitis, R. J. Miller, and W. C. Tan. Peer data exchange. ACM Trans. Database Syst., 31(4):1454-1498, 2006.
16. A. Fuxman and R. J. Miller. First-order query rewriting for inconsistent databases. J. Comput. Syst. Sci., 73(4):610-635, 2007.
17. M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990.
18. G. Gottlob and A. Nash. Efficient core computation in data exchange. Journal of the ACM, 55(2):1-49, 2008.
19. G. Grahne and A. Onet. Data correspondence, exchange and repair. In ICDT, pages 219-230, 2010.
20. A. Hernich. Foundations of Query Answering in Relational Data Exchange. PhD thesis, Goethe-Universität Frankfurt am Main, 2010.
21. A. Hernich and N. Schweikardt. CWA-solutions for data exchange settings with target dependencies. In PODS, pages 113-122, 2007.
22. P. G. Kolaitis, J. Panttaja, and W.-C. Tan. The complexity of data exchange. In Proceedings of PODS'06, pages 30-39, 2006.
23. P. G. Kolaitis and E. Pema. A dichotomy in the complexity of consistent query answering for queries with two atoms. Inf. Process. Lett., 112(3):77-85, 2012.
24. C. M. Papadimitriou. Computational complexity. Addison-Wesley, Reading, Massachusetts, 1994.
25. R. Rosati. On the finite controllability of conjunctive query answering in databases under open-world assumption. J. Comput. Syst. Sci., 77(3):572-594, 2011.
26. S. Staworko and J. Chomicki. Consistent query answers in the presence of universal constraints. Information Systems, 35(1):1-22, 2010.
27. J. Wijsen. Database repairing using updates. ACM Trans. Database Syst., 30:722-768, September 2005.
28. J. Wijsen. On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases. In PODS, pages 179-190, 2010.
29. J. Wijsen. A remark on the complexity of consistent conjunctive query answering under primary key violations. Inf. Process. Lett., 110(21):950-955, 2010.