Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies

  • Jef Wijsen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4027)


Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for universal relations that are inconsistent with respect to a set of functional dependencies. In order to obtain more meaningful repairs, we apply a project-join dependency prior to repairing by tuple deletion. A positive result is that the additional project-join can yield tractability of consistent query answering.


Relation Schema Relation Symbol Conjunctive Query Query Answer Consistent Answer 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Imielinski, T., Lipski Jr., W.: Incomplete information in relational databases. J. ACM 31(4), 761–791 (1984)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  3. 3.
    Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. I. Computer Science Press (1988)Google Scholar
  4. 4.
    Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Information and Computation 197(1-2), 90–121 (2005)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proc. 18th ACM Symp. on Principles of Database Systems, pp. 68–79. ACM Press, New York (1999)Google Scholar
  6. 6.
    Celle, A., Bertossi, L.: Querying inconsistent databases: Algorithms and implementation. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS, vol. 1861, pp. 942–956. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  7. 7.
    Fuxman, A.D., Miller, R.J.: First-order query rewriting for inconsistent databases. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 337–351. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Grieco, L., Lembo, D., Rosati, R., Ruzzi, M.: Consistent query answering under key and exclusion dependencies: Algorithms and experiments. In: Proc. 14th ACM Int. Conf. on Information and Knowledge Management (CIKM 2005), pp. 792–799. ACM, New York (2005)CrossRefGoogle Scholar
  9. 9.
    Arieli, O., Denecker, M., Van Nuffelen, B., Bruynooghe, M.: Database repair by signed formulae. In: Seipel, D., Turull-Torres, J.M.a. (eds.) FoIKS 2004. LNCS, vol. 2942, pp. 14–30. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Lin, J., Mendelzon, A.O.: Merging databases under constraints. Int. J. Cooperative Inf. Syst. 7(1), 55–76 (1998)CrossRefGoogle Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    Bohannon, P., Fan, W., Flaster, M., Rastogi, R.: A cost-based model and effective heuristic for repairing constraints by value modification. In: Proc. of the 24th ACM SIGMOD Int. Conf. on Management of Data, pp. 143–154. ACM Press, New York (2005)Google Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    Wijsen, J.: Database repairing using updates. ACM Trans. Database Syst. 30(3), 722–768 (2005)CrossRefGoogle Scholar
  15. 15.
    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)Google Scholar
  16. 16.
    Arenas, M., Bertossi, L.E., Chomicki, J.: Answer sets for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming 3(3-4), 393–424 (2003)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Greco, G., Greco, S., Zumpano, E.: A logical framework for querying and repairing inconsistent databases. IEEE Trans. Knowledge and Data Eng. 25(6), 1389–1408 (2003)CrossRefGoogle Scholar
  18. 18.
    Chomicki, J., Marcinkowski, J., Staworko, S.: Computing consistent query answers using conflict hypergraphs. In: Proc. 13th ACM Int. Conf. on Information and Knowledge Management (CIKM 2004), pp. 417–426. ACM Press, New York (2004)Google Scholar
  19. 19.
    Chomicki, J., Marcinkowski, J., Staworko, S.: Hippo: 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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jef Wijsen
    • 1
  1. 1.Université de Mons-HainautMonsBelgium

Personalised recommendations