Abstract
A framework for computing consistent answers to boolean aggregate queries in numerical databases violating a given set of aggregate constraints is introduced. Both aggregate constraints and queries are aggregation expressions consisting of linear inequalities on aggregate-sum functions. In particular, our approach works for a specific but expressive form of aggregation expressions (called steady aggregation expressions) and computes consistent answers by solving Integer Linear Programming (ILP) problem instances.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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. 18th ACM Symp. 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 Pract. of Logic Program (TPLP) 3(4-5), 393–424 (2003)
Arenas, M., Bertossi, L.E., Chomicki, J., He, X., Raghavan, V., Spinrad, J.: Scalar aggregation in inconsistent databases. Theor. Comput. Sci. (TCS) 3(296), 405–434 (2003)
Barceló, P., Bertossi, L.E.: Repairing databases with annotated predicate logic. In: Proc. 9th Int. Workshop on Non-Monotonic Reasoning (NMR), pp. 160–170 (2002)
Barceló, P., Bertossi, L.E.: Logic programs for querying inconsistent databases. In: Dahl, V., Wadler, P. (eds.) PADL 2003. LNCS, vol. 2562, pp. 208–222. Springer, Heidelberg (2002)
Bertossi, L.E., Bravo, L., Franconi, E., Lopatenko, A.: The complexity and approximation of fixing numerical attributes in databases under integrity constraints. Inf. Systems 33(4-5), 407–434 (2008)
Bohannon, P., Flaster, M., Fan, W., Rastogi, R.: A cost-based model and effective heuristic for repairing constraints by value modification. In: Proc. Int. Conf. on Management of Data (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. 22nd ACM Symp. 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. 13th Conf. on Information and Knowledge Management (CIKM), pp. 417–426 (2004)
Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Information and Computation (IC) 197(1-2), 90–121 (2005)
Fazzinga, B., Flesca, S., Furfaro, F., Parisi, F.: Dart: A data acquisition and repairing tool. In: Proc. Int. Workshop on Incons. and Incompl. in Databases (IIDB), pp. 297–317 (2006)
Flesca, S., Furfaro, F., Parisi, F.: Preferred database repairs under aggregate constraints. In: Prade, H., Subrahmanian, V.S. (eds.) SUM 2007. LNCS (LNAI), vol. 4772, pp. 215–229. Springer, Heidelberg (2007)
Flesca, S., Furfaro, F., Parisi, F.: Querying and Repairing Inconsistent Numerical Databases. ACM Transactions on Database Systems (TODS) 35(2) (2010)
Franconi, E., Palma, A.L., 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., Fazli, E., Miller, R.J.: Conquer: Efficient management of inconsistent databases. In: Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD), pp. 155–166 (2005)
Fuxman, A., Miller, R.J.: First-order query rewriting for inconsistent databases. J. Comput. Syst. Sci. 73(4), 610–635 (2007)
Greco, G., Greco, S., Zumpano, E.: A logical framework for querying and repairing inconsistent databases. IEEE Trans. on Knowledge and Data Engineering (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)
Ross, K.A., Srivastava, D., Stuckey, P.J., Sudarshan, S.: Foundations of aggregation constraints. Theorethical Computer Science (TCS) 193(1-2), 149–179 (1998)
Wijsen, J.: Database repairing using updates. ACM Transactions on Database Systems (TODS) 30(3), 722–768 (2005)
Wijsen, J.: Consistent query answering under primary keys: a characterization of tractable queries. In: Proc. 12th Int. Conf. on Database Theory (ICDT), pp. 42–52 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flesca, S., Furfaro, F., Parisi, F. (2010). Consistent Answers to Boolean Aggregate Queries under Aggregate Constraints. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds) Database and Expert Systems Applications. DEXA 2010. Lecture Notes in Computer Science, vol 6262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15251-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-15251-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15250-4
Online ISBN: 978-3-642-15251-1
eBook Packages: Computer ScienceComputer Science (R0)