Abstract
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole may fail to satisfy. Those answers are characterized as those that are invariant under minimal forms of restoring the consistency of the database. In this context, we study the problem of repairing databases by fixing integer numerical values at the attribute level with respect to denial and aggregation constraints. We introduce a quantitative definition of database fix, and investigate the complexity of several decision and optimization problems, including DFP, i.e. the existence of fixes within a given distance from the original instance, and CQA, i.e. deciding consistency of answers to aggregate conjunctive queries under different semantics. We provide sharp complexity bounds, identify relevant tractable cases; and introduce approximation algorithms for some of those that are intractable. More specifically, we obtain results like undecidability of existence of fixes for aggregation constraints; MAXSNP-hardness of DFP, but a good approximation algorithm for a relevant special case; and intractability but good approximation for CQA for aggregate queries for one database atom denials (plus built-ins).
Dedicated to the memory of Alberto Mendelzon. Our research on this topic started with conversations between Loreto Bravo and him. Alberto was always generous with his time, advice and ideas; our community is already missing him very much.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Arenas, M., Bertossi, L., Chomicki, J.: Consistent Query Answers in Inconsistent Databases. In: Proc. ACM Symposium on Principles of Database Systems (PODS 1999), pp. 68–79 (1999)
Arenas, M., Bertossi, L., Chomicki, J., He, X., Raghavan, V., Spinrad, J.: Scalar aggregation in inconsistent databases. Theoretical Computer Science 296, 405–434 (2003)
Bertossi, L., Chomicki, J.: Query Answering in Inconsistent Databases. In: Chomicki, J., Saake, G., van der Meyden, R. (eds.) Logics for Emerging Applications of Databases. Springer, Heidelberg (2003)
Bertossi, L., Bravo, L., Franconi, E., Lopatenko, A.: Fixing Numerical Attributes Under Integrity Constraints. Corr. Archiv. paper cs.DB/0503032; March 15 (2005)
Bohannon, P., Michael, F., Fan, F., 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 2005), pp. 143–154 (2005)
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 2003), pp. 260–271 (2003)
Chomicki, J., Marcinkowski, J.: Minimal-Change Integrity Maintenance Using Tuple Deletions. Information and Computation 197(1-2), 90–121 (2005)
Chvatal, V.: A Greedy Heuristic for the Set Covering Problem. Mathematics of Operations Research 4, 233–235 (1979)
Flesca, S., Furfaro, F., Parisi, F.: Consistent Query Answers on Numerical Databases under Aggregate Constraints. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 279–294. Springer, Heidelberg (2005)
Franconi, E., Laureti Palma, A., Leone, N., Perri, S., Scarcello, F.: Census Data Repair: a Challenging Application of Disjunctive Logic Programming. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 561–578. Springer, Heidelberg (2001)
Fuxman, A., Miller, R.: First-Order Query Rewriting for Inconsistent Databases. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 337–351. Springer, Heidelberg (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)
Garey, M., Johnson, D., Stockmeyer, L.: Some Simplified NP-Complete Graph Problems. Theoretical Computer Science 1(3), 237–267 (1976)
Halldorsson, M., Radhakrishnan, J.: Greed is Good: Approximating Independent Sets in Sparse and Bounded-degree Graphs. In: Proc. ACM Symposium on Theory of Computing (SToC 1994), pp. 439–448 (1994)
Hochbaum, D. (ed.): Approximation Algorithms for NP-Hard Problems. PWS (1997)
Krentel, M.: The Complexity of Optimization Problems. J. Computer and Systems Sciences 36, 490–509 (1988)
Kuper, G., Libkin, L., Paredaens, J. (eds.): Constraint Databases. Springer, Heidelberg (2000)
Lin, J., Mendelzon, A.O.: Merging Databases under Constraints. International Journal of Cooperative Information Systems 7(1), 55–76 (1996)
Lund, C., Yannakakis, M.: On the Hardness of Approximating Minimization Problems. J. of the Association for Computing Machinery 45(5), 960–981 (1994)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
Papadimitriou, C., Yannakakis, M.: Optimization, Approximation and Complexity Classes. J. Computer and Systems Sciences 43, 425–440 (1991)
Ross, K., Srivastava, D., Stuckey, P., Sudarshan, S.: Foundations of Aggregation Constraints. Theoretical Computer Science 193(1-2), 149–179 (1998)
Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)
Wijsen, J.: Condensed Representation of Database Repairs for Consistent Query Answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 375–390. Springer, Heidelberg (2002)
Wijsen, J.: Making More Out of an Inconsistent Database. In: Benczúr, A.A., Demetrovics, J., Gottlob, G. (eds.) ADBIS 2004. LNCS, vol. 3255, pp. 291–305. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertossi, L., Bravo, L., Franconi, E., Lopatenko, A. (2005). Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints. In: Bierman, G., Koch, C. (eds) Database Programming Languages. DBPL 2005. Lecture Notes in Computer Science, vol 3774. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11601524_17
Download citation
DOI: https://doi.org/10.1007/11601524_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30951-2
Online ISBN: 978-3-540-31445-5
eBook Packages: Computer ScienceComputer Science (R0)