Advertisement

Consistent Answers to Boolean Aggregate Queries under Aggregate Constraints

  • Sergio Flesca
  • Filippo Furfaro
  • Francesco Parisi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6262)

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

Aggregation Function Integrity Constraint Relation Scheme Database Scheme Conjunctive Query 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Information and Computation (IC) 197(1-2), 90–121 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Flesca, S., Furfaro, F., Parisi, F.: Querying and Repairing Inconsistent Numerical Databases. ACM Transactions on Database Systems (TODS) 35(2) (2010)Google Scholar
  14. 14.
    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)CrossRefGoogle Scholar
  15. 15.
    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)Google Scholar
  16. 16.
    Fuxman, A., Miller, R.J.: First-order query rewriting for inconsistent databases. J. Comput. Syst. Sci. 73(4), 610–635 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    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)CrossRefGoogle Scholar
  18. 18.
    Papadimitriou, C.H.: On the complexity of integer programming. Journal of the Association for Computing Machinery (JACM) 28(4), 765–768 (1981)zbMATHMathSciNetGoogle Scholar
  19. 19.
    Ross, K.A., Srivastava, D., Stuckey, P.J., Sudarshan, S.: Foundations of aggregation constraints. Theorethical Computer Science (TCS) 193(1-2), 149–179 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Wijsen, J.: Database repairing using updates. ACM Transactions on Database Systems (TODS) 30(3), 722–768 (2005)CrossRefGoogle Scholar
  21. 21.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Sergio Flesca
    • 1
  • Filippo Furfaro
    • 1
  • Francesco Parisi
    • 1
  1. 1.DEISUniversità della CalabriaRendeItaly

Personalised recommendations