Skip to main content

Making More Out of an Inconsistent Database

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3255))

Abstract

Repairing a database means making the database consistent by applying changes that are as small as possible. Nearly all approaches to repairing have assumed deletions and insertions of entire tuples as basic repair primitives. A negative effect of deletions is that when a tuple is deleted because it contains an error, the correct values contained in that tuple are also lost. It can be semantically more meaningful to update erroneous values in place, called update-based repairing.

We prove that a previously proposed approach to update-based repairing leads to intractability. Nevertheless, we also show that the complexity decreases under the rather plausible assumption that database errors are mutually independent.

An inconsistent database can generally be repaired in many ways. The consistent answer to a query on a database is usually defined as the intersection of the answers to the query on all repaired versions of the database. We propose an alternative semantics, defining the consistent answer as being maximal homomorphic to the answers on all repairs. This new semantics always produces more informative answers and ensures closure of conjunctive queries under composition.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proc. 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 68–79. ACM Press, New York (1999)

    Google Scholar 

  2. 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. 378–393. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  4. Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Information and Computation (to appear)

    Google Scholar 

  5. Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. 22nd ACM Symposium on Principles of Database Systems, pp. 260–271. ACM Press, New York (2003)

    Google Scholar 

  6. Chomicki, J., Marcinkowski, J.: On the computational complexity of minimalchange integrity maintenance in relational databaes. In: Bertossi, L., Hunter, A., Schaub, T. (eds.) Inconsistency Tolerance. LNCS, vol. 3300, pp. 119–150. Springer, Heidelberg (2005) (to appear)

    Chapter  Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  8. Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. Journal of the ACM 31, 718–741 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  9. Nienhuys-Cheng, S.H., de Wolf, R.: Least generalizations and greatest specializations of sets of clauses. Journal of Artificial Intelligence Research 4, 341–363 (1996)

    MATH  MathSciNet  Google Scholar 

  10. Bry, F.: Query answering in information systems with integrity constraints. In: First IFIP WG 11.5 Working Conference on Integrity and Internal Control in Information Systems: Increasing the Confidence in Information Systems, Zurich, Switzerland, December 4-5, pp. 113–130. Chapman Hall, Boca Raton (1997)

    Google Scholar 

  11. Arenas, M., Bertossi, L., Chomicki, J.: Answer sets for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming 3, 393–424 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Greco, G., Greco, S., Zumpano, E.: A logic programming approach to the integration, repairing and querying of inconsistent databases. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 348–364. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Greco, G., Greco, S., Zumpano, E.: A logical framework for querying and repairing inconsistent databases. IEEE Trans. on Knowledge and Data Engineering 25, 1389–1408 (2003)

    Article  Google Scholar 

  14. Bertossi, L., Schwind, C.: Database repairs and analytic tableaux. Annals of Mathematics and Artificial Intelligence 40, 5–35 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  15. Arenas, M., Bertossi, L., Kifer, M.: Applications of Annotated Predicate Calculus to Querying Inconsistent Databases. 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 (LNAI), vol. 1861, pp. 926–941. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Mayol, E., Teniente, E.: Consistency preserving updates in deductive databases. Data & Knowledge Engineering 47, 61–103 (2003)

    Article  Google Scholar 

  17. Lembo, D., Lenzerini, M., Rosati, R.: Source inconsistency and incompleteness in data integration. In: Proc. 9th Int. Workshop on Knowledge Representation meets Databases (KRDB 2002). CEUR Workshop Proceedings, vol. 54 (2002)

    Google Scholar 

  18. Calì, A., Calvanese, D., Giacomo, G.D., Lenzerini, M.: Data integration under integrity constraints. Information Systems 29, 147–163 (2004)

    Article  Google Scholar 

  19. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 207–224. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Fagin, R., Kolaitis, P.G., Popa, L.: Data exchange: Getting to the core. In: Proc. 22nd ACM Symposium on Principles of Database Systems, pp. 90–101. ACM Press, New York (2003)

    Google Scholar 

  21. Bertossi, L., Chomicki, J.: Query answering in inconsistent databases. In: Chomicki, J., van der Meyden, R., Saake, G. (eds.) Logics for Emerging Applications of Databases, pp. 43–83. Springer, Heidelberg (2003)

    Google Scholar 

  22. Arenas, M., Bertossi, L., Chomicki, J., He, X., Raghavan, V., Spinrad, J.: Scalar aggregation in inconsistent databases. Theoretical Computer Science 296, 405–434 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wijsen, J. (2004). Making More Out of an Inconsistent Database. In: Benczúr, A., Demetrovics, J., Gottlob, G. (eds) Advances in Databases and Information Systems. ADBIS 2004. Lecture Notes in Computer Science, vol 3255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30204-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30204-9_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23243-8

  • Online ISBN: 978-3-540-30204-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics