Skip to main content
SpringerLink
Log in

Exploiting Conflict Structures in Inconsistent Databases

  • Conference paper
Book cover Advances in Databases and Information Systems (ADBIS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6295))

Abstract

For an inconsistent database that violates a set of (conditional) functional dependencies, we define a basic conflict as a minimal set of attribute values, of which at least one needs to be changed in any attribute-based repair. Assuming that the collection of all basic conflicts is given, we show how we can exploit it in two important applications. The first application is cleaning the answer to a query by deciding whether a set of tuples is a possible answer, i.e., they are present in the result of the query applied to some minimal repair. We motivate an alternative notion of answer with a consistent derivation, which requires that the tuples are obtained through the same occurrences of attribute values in both the inconsistent database and the repair. The second application is cleaning data by generating repairs that are at a “reasonable” distance to the original database. Finally, we complement the above results and show that, if dependencies do not form a certain type of cycle, the cardinality of basic conflicts in any inconsistent database is bounded, and therefore it is possible to detect all basic conflicts in an inconsistent database in polynomial time in the size of input database.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Kanellakis, P.C., Grahne, G.: On the representation and querying of sets of possible worlds. Theor. Comput. Sci. 78(1), 158–187 (1991)

    MathSciNet  Google Scholar 

  2. Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: PODS, pp. 68–79 (1999)

    Google Scholar 

  3. Arenas, M., Bertossi, L.E., Chomicki, J.: Answer sets for consistent query answering in inconsistent databases. TPLP 3(4-5), 393–424 (2003)

    MATH  MathSciNet  Google Scholar 

  4. Arenas, M., Bertossi, L.E., Chomicki, J., He, X., Raghavan, V., Spinrad, J.: Scalar aggregation in inconsistent databases. Theor. Comput. Sci. 3(296), 405–434 (2003)

    Article  MathSciNet  Google Scholar 

  5. Arenas, M., Bertossi, L.E., Kifer, M.: Applications of annotated predicate calculus to querying inconsistent databases. In: Computational Logic, pp. 926–941 (2000)

    Google Scholar 

  6. Barceló, P., Bertossi, L.E., Bravo, L.: Characterizing and computing semantically correct answers from databases with annotated logic and answer sets. In: Semantics in Databases, pp. 7–33 (2001)

    Google Scholar 

  7. Benjelloun, O., Sarma, A.D., Halevy, A.Y., Widom, J.: Uldbs: Databases with unvertainty and lineage. In: VLDB, pp. 953–964 (2006)

    Google Scholar 

  8. Bertossi, L.E.: Consistent query answering in databases. SIGMOD Record 35(2), 68–76 (2006)

    Article  Google Scholar 

  9. Bertossi, L.E., Bravo, L., Franconi, E., Lopatenko, A.: The complexity and approximation of fixing numerical attributes in databases under integrity constraints. Inf. Syst. 33(4-5), 407–434 (2008)

    Article  Google Scholar 

  10. Bohannon, P., Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for data cleaning. In: ICDE, pp. 746–755 (2007)

    Google Scholar 

  11. Bohannon, P., Flaster, M., Fan, W., Rastogi, R.: A cost-based model and effective heuristic for repairing constraints by value modification. In: SIGMOD Conference, pp. 143–154 (2005)

    Google Scholar 

  12. Buneman, P., Khanna, S., Tan, W.C.: Why and where: A characterization of data provenance. In: ICDT, pp. 316–330 (2001)

    Google Scholar 

  13. Buneman, P., Khanna, S., Tan, W.C.: On propagation of deletions and annotations through views. In: PODS, pp. 150–158 (2002)

    Google Scholar 

  14. Chomicki, J.: Consistent query answering: Five easy pieces. In: ICDT, pp. 1–17 (2007)

    Google Scholar 

  15. Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Inf. Comput. 197(1-2), 90–121 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  16. Cong, G., Fan, W., Geerts, F., Jia, X., Ma, S.: Improving data quality: Consistency and accuracy. In: VLDB, pp. 315–326 (2007)

    Google Scholar 

  17. Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS (1997)

    Google Scholar 

  18. Fan, W.: Dependencies revisited for improving data quality. In: PODS, pp. 159–170 (2008)

    Google Scholar 

  19. Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for capturing data inconsistencies. ACM Trans. Database Syst. 33(2) (2008)

    Google Scholar 

  20. Flesca, S., Furfaro, F., Parisi, F.: Consistent query answers on numerical databases under aggregate constraints. In: DBPL, pp. 279–294 (2005)

    Google Scholar 

  21. Fuxman, A., Miller, R.J.: First-order query rewriting for inconsistent databases. J. Comput. Syst. Sci. 73(4), 610–635 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  22. Geerts, F., Kementsietsidis, A., Milano, D.: Mondrian: Annotating and querying databases through colors and blocks. In: ICDE, p. 82 (2006)

    Google Scholar 

  23. Grahne, G., Mendelzon, A.O.: Tableau techniques for querying information sources through global schemas. In: ICDT, pp. 332–347 (1999)

    Google Scholar 

  24. Greco, S., Molinaro, C.: Approximate probabilistic query answering over inconsistent databases. In: Li, Q., Spaccapietra, S., Yu, E., Olivé, A. (eds.) ER 2008. LNCS, vol. 5231, pp. 311–325. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  25. Kolahi, S., Lakshmanan, L.V.S.: On approximating optimum repairs for functional dependency violations. In: ICDT, pp. 53–62 (2009)

    Google Scholar 

  26. Kolahi, S., Lakshmanan, L.V.S.: Exploiting conflict structures in inconsistent databases (2010) (full version), http://www.cs.ubc.ca/~solmaz/conflict-proofs.pdf

  27. Levene, M., Loizou, G.: Database design for incomplete relations. ACM Trans. Database Syst. 24(1), 80–125 (1999)

    Article  MathSciNet  Google Scholar 

  28. Levene, M., Loizou, G.: A Guided Tour of Relational Databases and Beyond. Springer, London (1999)

    Google Scholar 

  29. Lopatenko, A., Bravo, L.: Efficient approximation algorithms for repairing inconsistent databases. In: ICDE, pp. 216–225 (2007)

    Google Scholar 

  30. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2003)

    Google Scholar 

  31. Wijsen, J.: Database repairing using updates. ACM Trans. Database Syst. 30(3), 722–768 (2005)

    Article  Google Scholar 

  32. Wijsen, J.: Consistent query answering under primary keys: a characterization of tractable queries. In: ICDT, pp. 42–52 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of British Columbia,  

    Solmaz Kolahi & Laks V. S. Lakshmanan

Authors
  1. Solmaz Kolahi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laks V. S. Lakshmanan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Infoamtion Science, University of Genova, Via Dodecaneso, 35, 16146, Genova, Italy

    Barbara Catania

  2. Faculty of Science, Department of Mathematics and Informatics, University of Novi Sad, Trg Dositeja Obradovica 4, 21000, Novi Sad, Serbia

    Mirjana Ivanović

  3. Institute of Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kolahi, S., Lakshmanan, L.V.S. (2010). Exploiting Conflict Structures in Inconsistent Databases. In: Catania, B., Ivanović, M., Thalheim, B. (eds) Advances in Databases and Information Systems. ADBIS 2010. Lecture Notes in Computer Science, vol 6295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15576-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15576-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15575-8

  • Online ISBN: 978-3-642-15576-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation