Complexity and approximation of fixing numerical attributes in databases under integrity constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3774 LNCS, Issue , 2005, Pages 262-278

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

^a CARLETON UNIVERSITY   (Canada)

^b FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^c UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING;

INTEGRITY CONSTRAINTS; NUMERICAL ATTRIBUTES; OPTIMIZATION PROBLEMS;

DATABASE SYSTEMS;

EID: 33745329531     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (26)

1. Abiteboul, S., Hull, R. and Vianu, V. Foundations of Databases. Addison-Wesley, 1995.
2. Arenas, M, Bertossi, L. and Chomicki, J. Consistent Query Answers in Inconsistent Databases. In Proc. ACM Symposium on Principles of Database Systems (PODS 99), 1999, pp. 68-79.
3. Arenas, M, Bertossi, L. and Chomicki, J., He, X., Raghavan, V., and Spinrad, J. Scalar aggregation in inconsistent databases. Theoretical Computer Science, 2003, 296:405-434.
4. Bertossi, L. and Chomicki, J. Query Answering in Inconsistent Databases. In Logics for Emerging Applications of Databases, J. Chomicki, G. Saake and R. van der Meyden (eds.), Springer, 2003.
5. Bertossi, L., Bravo, L., Franconi, E. and Lopatenko, A. Fixing Numerical Attributes Under Integrity Constraints. Corr Archiv paper cs.DB/0503032; March 15, 2005.
6. Bohannon, P., Michael, P., Fan, P. and Rastogi, R. A Cost-Based Model and Effective Heuristic for Repairing Constraints by Value Modification. In Proc. ACM International Conference on Management of Data (SIGMOD 05), 2005, pp. 143-154.
7. Cali, A., Lembo, D., Rosati, R. On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases. In Proc. ACM Symposium on Principles of Database Systems (PODS 03), 2003, pp. 260-271.
8. Chomicki, J. and Marcinkowski, J. Minimal-Change Integrity Maintenance Using Tuple Deletions. Information and Computation, 2005, 197(1-2):90-121.
9. Chvatal, V. A Greedy Heuristic for the Set Covering Problem. Mathematics of Operations Research, 1979, 4:233-235.
10. Flesca, S., Furfaro, P. and Parisi, P. Consistent Query Answers on Numerical Databases under Aggregate Constraints. In Proc. Tenth International Symposium on Database Programming Languages (DBPL 05), 2005.
11. Franconi, E., Laureti Palma, A., Leone, N., Perri, S. and Scarcello, P. Census Data Repair: a Challenging Application of Disjunctive Logic Programming. In Proc. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 01). Springer LNCS 2250, 2001, pp. 561-578.
12. Fuxman, A. and Miller, R. First-Order Query Rewriting for Inconsistent Databases. In Proc. International Conference on Database Theory (ICDT 05), Springer LNCS 3363, 2004, pp. 337-354.
13. Garey, M.R. and Johnson, D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
14. Garey, M., Johnson, D. and Stockmeyer, L. Some Simplified NP-Complete Graph Problems. Theoretical Computer Science, 1976, 1(3):237-267.
15. Halldorsson, M. and Radhakrishnan, J. Greed is Good: Approximating Independent Sets in Sparse and Bounded-degree Graphs. In Proc. ACM Symposium on Theory of Computing (SToC 94), 1994, pp. 439-448.
16. Hochbaum, D.(ed.) Approximation Algorithms for NP-Hard Problems. PWS, 1997.
17. Krentel, M. The Complexity of Optimization Problems. J. Computer and Systems Sciences, 1988, 36:490-509.
18. Kuper, G., Libkin, L. and Paredaens, J.(eds.) Constraint Databases. Springer, 2000.
19. Lin, J. and Mendelzon, A.O. Merging Databases under Constraints. International Journal of Cooperative Information Systems, 1996, 7(1):55-76.
20. Lund, C. and Yannakakis, M. On the Hardness of Approximating Minimization Problems. J. of the Association for Computing Machinery, 1994, 45(5):960-981.
21. Papadimitriou, Ch. Computational Complexity. Addison-Wesley, 1994.
22. Papadimitriou, Ch. and Yannakakis, M. Optimization, Approximation and Complexity Classes. J. Computer and Systems Sciences, 1991, 43:425-440.
23. Ross, K., Srivastava, D., Stuckey, P., and Sudarshan, S.. Foundations of Aggregation Constraints. Theoretical Computer Science, 1998, 193(1-2):149-179.
24. Vazirani, V. Approximation Algorithms. Springer, 2001.
25. Wijsen, J. Condensed Representation of Database Repairs for Consistent Query Answering. In Proc. International Conference on Database Theory (ICDT 03), Springer LNCS 2572, 2003, pp. 378-393.
26. Wijsen, J. Making More Out of an Inconsistent Database, In Proc. East-European Conference on Advances in Databases and Information Systems (ADBIS 04), Springer LNCS 3255, 2004, pp. 291-305.