Abstract
A framework for computing preferred repairs in numerical databases violating a given set of strong and weak aggregate constraints is introduced, which is based on a transformation into an Integer Linear Programming (ILP) instance. Aggregate constraints are linear inequalities on aggregates retrieved from the input data. While strong constraints express mandatory conditions, weak constraints define conditions which are expected to be satisfied, even if this is not mandatory. Thus, preferred repairs are repairs which make the data satisfy all the given strong constraints and as many weak constraints as possible. An experimental validation of the proposed approach is provided, proving its effectiveness.
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
Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent Query Answers in Inconsistent Databases. In: Proc. Symposium on Principles of Database Systems (PODS), pp. 68–79 (1999)
Arenas, M., Bertossi, L.E., Chomicki, J.: Answer Sets for Consistent Query Answering in Inconsistent Databases. Theory and practice of logic program 3(4-5), 393–424 (2003)
Arenas, M., Bertossi, L.E., Chomicki, J., He, X., Raghavan, V., Spinrad, J.: Scalar aggregation in inconsistent databases. Theoretical Computer Science 3(296), 405–434 (2003)
Bertossi, L.E., Chomicki, J.: Query Answering in Inconsistent Databases. In: Logics for Emerging Applications of Databases, pp. 43–83 (2003)
Bertossi, L., Bravo, L., Franconi, E., Lopatenko, A.: Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 262–278. Springer, Heidelberg (2005)
Bohannon, P., Flaster, M., Fan, W., Rastogi, R.: A Cost-Based Model and Effective Heuristic for Repairing Constraints by Value Modification. In: Proc. ACM SIGMOD, pp. 143–154 (2005)
Calí, 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), pp. 260–271 (2003)
Chomicki, J., Marcinkowski, J., Staworko, S.: Computing consistent query answers using conflict hypergraphs. In: Proc. International Conference on Information and Knowledge Management (CIKM), pp. 417–426 (2004)
Chomicki, J., Marcinkowski, J., Staworko, S., Hippo, A.: A System for Computing Consistent Answers to a Class of SQL Queries. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 841–844. Springer, Heidelberg (2004)
Chomicki, J., Marcinkowski, J.: Minimal-Change Integrity Maintenance Using Tuple Deletions. Information and Computation (IC) 197(1-2), 90–121 (2005)
Chomicki, J., Marcinkowski, J.: On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational Databases. In: Inconsistency Tolerance, pp. 119–150 (2005)
Flesca, S., Furfaro, F., Parisi, F.: Consistent Query Answer on Numerical Databases under Aggregate Constraint. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 279–294. Springer, Heidelberg (2005)
Fuxman, A., Miller, R.J.: ConQuer: Efficient Management of Inconsistent Databases. In: Proc. ACM SIGMOD International Conference on Management of Data, pp. 155–166 (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)
Gass, S.I.: Linear Programming Methods and Applications. McGrawHill, New York (1985)
Greco, G., Greco, S., Zumpano, E.: A Logical Framework for Querying and Repairing Inconsistent Databases. IEEE TKDE 15(6), 1389–1408 (2003)
Papadimitriou, C.H.: On the complexity of integer programming. Journal of the Association for Computing Machinery (JACM) 28(4), 765–768 (1981)
Wijsen, J.: Database Repairing Using Updates. ACM Transactions on Database Systems (TODS) 30(3), 722–768 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flesca, S., Furfaro, F., Parisi, F. (2007). Preferred Database Repairs Under Aggregate Constraints. In: Prade, H., Subrahmanian, V.S. (eds) Scalable Uncertainty Management. SUM 2007. Lecture Notes in Computer Science(), vol 4772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75410-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-75410-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75407-7
Online ISBN: 978-3-540-75410-7
eBook Packages: Computer ScienceComputer Science (R0)