The complexity and approximation of fixing numerical attributes in databases under integrity constraints

Information Systems

Volumn 33, Issue 4-5, 2008, Pages 407-434

  Bertossi, Leopoldo ^a   Bravo, Loreto ^b   Franconi, Enrico ^c   Lopatenko, Andrei ^d  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

^c FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^d GOOGLE INC   (United States)

Author keywords

Consistent query answering; Database repairs; Inconsistent databases; Integrity constraints

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; DATABASE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

CONSISTENT QUERY ANSWERING; DATABASE REPAIRS; INCONSISTENT DATABASES; INTEGRITY CONSTRAINTS;

QUERY PROCESSING;

EID: 43049121399     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2008.01.005     Document Type: Article

References (34)

1. Bertossi L., and Chomicki J. Query answering in inconsistent databases. In: Chomicki J., Saake G., and van der Meyden R. (Eds). Logics for Emerging Applications of Databases (2003), Springer, Berlin
2. Arenas M., Bertossi L., and Chomicki J. Consistent query answers in inconsistent databases. Proceedings of the ACM Symposium on Principles of Database Systems (PODS 99) (1999) 68-79
3. E. Franconi, A. Laureti Palma, N. Leone, S. Perri, F. Scarcello, Census data repair: a challenging application of disjunctive logic programming, in: Proceedings of Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 01), Lecture Notes in Computer Science, vol. 2250, Springer, Berlin, 2001, pp. 561-578.
4. Bertossi L. Consistent query answering in databases. ACM Sigmod Record 35 2 (2006) 68-76
5. J. Chomicki, Consistent query answering: five easy pieces, in: Proceedings of the 11th International Conference on Database Theory (ICDT 07), Lecture Notes in Computer Science, vol. 4353, Springer, Berlin, 2007, pp. 1-17.
6. J. Wijsen, Condensed representation of database repairs for consistent query answering, in: Proceedings of the International Conference on Database Theory (ICDT 03), Lecture Notes in Computer Science, vol. 2572, Springer, Berlin, 2003, pp. 378-393.
7. J. Wijsen, Making more out of an inconsistent database, in: Proceedings of East-European Conference on Advances in Databases and Information Systems (ADBIS 04), Lecture Notes in Computer Science, vol. 3255, Springer, Berlin, 2004, pp. 291-305.
8. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison-Wesley, Reading, MA
9. Papadimitriou Ch. Computational Complexity (1994), Addison-Wesley, Reading, MA
10. G. Kuper, L. Libkin, J. Paredaens (Eds.), Constraint Databases, Springer, Berlin, 2000.
11. Arenas M., Bertossi L., Chomicki J., He X., Raghavan V., and Spinrad J. Scalar aggregation in inconsistent databases. Theoret. Comput. Sci. 296 (2003) 405-434
12. Krentel M. The complexity of optimization problems. J. Comput. Systems Sci. 36 (1988) 490-509
13. D. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS, 1997.
14. Chomicki J., and Marcinkowski J. Minimal-change integrity maintenance using tuple deletions. Inform. Comput. 197 1-2 (2005) 90-121
15. Lund C., and Yannakakis M. On the hardness of approximating minimization problems. J. Assoc. Comput. Machinery 45 5 (1994) 960-981
16. Chvatal V. A greedy heuristic for the set covering problem. Math. Oper. Res. 4 (1979) 233-235
17. Fuxman A., and Miller R. First-order query rewriting for inconsistent databases. J. Comput. System Sci. 73 4 (2007) 537-690
18. Garey M., Johnson D., and Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1 3 (1976) 237-267
19. Halldorsson M., and Radhakrishnan J. Greed is good: approximating independent sets in sparse and bounded-degree graphs. Proceedings of the ACM Symposium on Theory of Computing (SToC 94) (1994) 439-448
20. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, New York
21. Vazirani V. Approximation Algorithms (2001), Springer, Berlin
22. L. Bertossi, L. Bravo, E. Franconi, A. Lopatenko, The complexity and approximation of fixing numerical attributes in databases under integrity constraints, Extended version with appendices 〈http://www.scs.carleton.ca/∼bertossi/papers/longIS07.pdf〉.
23. Ross K., Srivastava D., Stuckey P., and Sudarshan S. Foundations of aggregation constraints. Theoret. Comput. Sci. 193 1-2 (1998) 149-179
24. Lopatenko A., and Bravo L. Efficient approximation algorithms for repairing inconsistent databases. Proceedings of the International Conference on Data Engineering (ICDE'03) (2003) 216-225
25. A. Boskovitz, R. Goré, P. Wong, Data editing and logic, in: Proceedings of the Work Session on Statistical Data Editing, United Nations Statistical Commission and Economic Commission for Europe, Conference of European Statisticians, Ottawa, Canada, May 2005 〈http://www.unece.org/stats/documents/2005.05.sde.htm〉.
26. United Nations Statistical Commission and Economic Commission for Europe. Glossary of Terms on Statistical Data Editing. Conference of European Statisticians, Methodological Material, United Nations, Geneva, 2000, 18pp 〈http://www.unece.org/stats/publications/editingglossary.pdf〉.
27. Cali A., Lembo D., and Rosati R. On the decidability and complexity of query answering over inconsistent and incomplete databases. Proceedings of the ACM Symposium on Principles of Database Systems (PODS 03) (2003) 260-271
28. Lin J., and Mendelzon A.O. Merging databases under constraints. Int. J. Cooperative Inform. Syst. 7 1 (1996) 55-76
29. S. Flesca, F. Furfaro, F. Parisi, Consistent query answers on numerical databases under aggregate constraints, in: Proceedings of the Tenth International Symposium on Database Programming Languages (DBPL 05), Lecture Notes in Computer Science, vol. 3774, Springer, Berlin, 2005, pp. 279-294.
30. B. Fazzinga, S. Flesca, F. Furfaro, F. Parisi, DART: a data acquisition and repairing tool, in: Current Trends in Database Technology. EDBT 2006 Workshops (Proceedings of the IIDB 06), Lecture Notes in Computer Science, vol. 4254, Springer, Berlin, 2006, pp. 297-317.
31. Bohannon P., Fan W., Flaster M., and Rastogi R. A cost-based model and effective heuristic for repairing constraints by value modification. Proceedings of the ACM International Conference on Management of Data (SIGMOD 05) (2005) 143-154
32. Fellegi P., and Holt D. A systematic approach to automatic edit and imputation. J. Amer. Statist. Assoc. 71 353 (1976) 17-35
33. Bruni R. Error correction for massive data sets. Optim. Methods Software 20 2-3 (2005) 295-314
34. Boskovitz A., Goré R., and Hegland M. A logical formalisation of the fellegi-holt method of data cleaning. Lecture Notes in Computer Science vol. 2810 (2003), Springer, Berlin 554-565