Efficient approximation algorithms for repairing inconsistent databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 216-225

  Lopatenko, Andrei ^a   Bravo, Loreto ^b,c  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b CARLETON UNIVERSITY   (Canada)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATABASE SYSTEMS;

COMPUTATIONALLY INTRACTABLE; DATABASE REPAIR; INTEGRITY CONSTRAINTS;

APPROXIMATION ALGORITHMS;

EID: 34548775857     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367867     Document Type: Conference Paper

References (22)

1. M. Arenas, L. Bertossi, and J. Chomicki. Consistent Query Answers in Inconsistent Databases. In Proc. of PODS'99, pages 68-79. ACM Press, 1999.
2. M. Arenas, L. Bertossi, J. Chomicki, X. He, V. Raghavan, and J. Spinrad. Scalar aggregation in inconsistent databases. Theoretical Computer Science, 296(3):405-434, 2003.
3. L. Bertossi and J. Chomicki. Logics for Emerging Applications of Databases, chapter Query Answering in Inconsistent Databases, pages 43-83. Springer, 2003.
4. L. Bertossi, L. Bravo, E. Franconi, and A. Lopatenko. Complexity and Approximation of Fixing Numerical Attributes in Databases under Integrity Constraints. In Proc. of DBPL'05, Springer LNCS 3774, pages 262-278, 2005.
5. L. Bertossi, L. Bravo, E. Franconi, and A. Lopatenko. Complexity and Approximation of Fixing Numerical Attributes in Databases under Integrity Constraints. Journal submission, 2006.
6. P. Bohannon, M. Flaster, W. Fan, and R. Rastogi. A Cost-based Model and Effective Heuristic for Repairing Constraints by Value Modification. In Proc. of SIGMOD Conference, pages 143-154. ACM, 2005.
7. F. Buccafurri, N. Leone, and P. Rullo. Enhancing Disjunctive Datalog by Constraints. IEEE Transactions on Knowledge and Data Engineering, 12(5):845-860, 2000.
8. A. Call, D. Lembo, and R. Rosati. On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases. In Proc. of PODS'03, pages 260-271. ACM Press, 2003.
9. J. Chomicki and J. Marcinkowski. Minimal-change Integrity Maintenance Using Tuple Deletions. Information and Computation, 197(1-2):90-121, 2005.
10. V. Chvatal A Greedy Heuristic for the Set Covering Problem. Mathematics of Operations Research, 4:233-235, 1979.
11. E. Franconi, A. Laureti-Palma, N. Leone, S. Perri, and F. Scarcello. Census Data, Repair: a Challenging Application of Disjunctive Logic Programming. In Proc. of LPAR'01, Springer LNCS 2250, pages 561-578, 2001.
12. A. Fuxman and R. J. Miller. First-order query rewriting for inconsistent databases. In Proc. of ICDT'05, Springer LNCS 3363, pages 337-351, 2005.
13. D. Hochbaum (ed.) Approximation Algorithms for NPHard Problems. PWS, 1997.
14. G. Kuper, L. Libkin and J. Paredaens.(eds.) Constraint Databases. Springer, 2000.
15. A. Lopatenko and L. Bertossi. Complexity of Consistent Query Answering in Databases under Cardinalitybased and Incremental Repair Semantics. To appear in Proc. ICDT'07, Springer, 2007.
16. C. Lund and M. Yannakakis On the Hardness of Approximating Minimization Problems. Journal of the Association for Computing Machinery, 45(5):960-981, 1994.
17. H. Midler and J.C. Freytag. Problems, Methods and Challenges in Comprehensive Data, Cleansing. Technical report, Humboldt-Universitat zu Berlin, Institut fr Informatik, 2003.
18. Ch. Papadimitriou Computational Complexity. Addison-Wesley, 1994.
19. E. Rahm and H. H. Do. Data Cleaning: Problems and Current Approaches. IEEE Data Engineering Bulletin, 23(4):3-13, 2000.
20. V. Vazirani Approximation Algorithms. Springer, 2001.
21. J. Wijsen. Condensed Representation of Database Repairs for Consistent Query Answering. In Proc. of ICDT'03, Springer LNCS 2572, pages 378-393, 2003.
22. J. Wijsen. Database Repairing using Updates. ACM Transactions on Database Systems, 30(3) :722-768, 2005.