Abstract
Repairing a database means bringing the database in accordance with a given set of integrity constraints by applying modifications that are as small as possible. In the seminal work of Arenas et al. on query answering in the presence of inconsistency, the possible modifications considered are deletions and insertions of tuples. Unlike earlier work, we also allow tuple updates as a repair primitive. Update-based repairing is advantageous, because it allows rectifying an error within a tuple without deleting the tuple, thereby preserving other consistent values in the tuple. At the center of the paper is the problem of query answering in the presence of inconsistency relative to this refined repair notion. Given a query, a trustable answer is obtained by intersecting the query answers on all repaired versions of the database. The problem arising is that, in general, a database can be repaired in infinitely many ways. A positive result is that for conjunctive queries and full dependencies, there exists a condensed representation of all repairs that permits computing trustable query answers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
M. Arenas, L. Bertossi, and M. Kifer. Applications of Annotated Predicate Calculus to Querying Inconsistent Databases. In Proc. 1st Int. Conf. on Computational Logic (CL 2000), volume 1861 of LNAI, pages 926–941. Springer, 2000.
M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In Proc. 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 68–79. ACM Press, 1999.
M. Arenas, L. E. Bertossi, and J. Chomicki. Specifying and querying database repairs using logic programs with exceptions. In Proc. 4th Int. Conf. on Flexible Query Answering Systems (FQAS 2000), Advances in Soft Computing, pages 27–41. Springer, 2000.
M. Arenas, L. E. Bertossi, and J. Chomicki. Scalar aggregation in FD-inconsistent databases. In Proc. 8th Int. Conf. on Database Theory (ICDT 2001), volume 1973 of LNCS, pages 39–53. Springer, 2001.
C. Beeri and M. Y. Vardi. A proof procedure for data dependencies. Journal of the ACM, 31(4):718–741, Oct. 1984.
L. Bertossi and C. Schwind. Analytic tableaux and database repairs: Foundations. In Proc. 2nd Int. Symposium on Foundations of Information and Knowledge Systems (FoIKS 2002), volume 2284 of LNCS, pages 32–48. Springer, 2002.
F. Bry. 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, 1997, pages 113–130. Chapman Hall, 1997.
A. Calí, D. Calvanese, G. D. Giacomo, and M. Lenzerini. Data integration under integrity constraints. In Proc. 14th Int. Conf. on Advanced Information Systems Engineering (CAiSE 2002), volume 2348 of LNCS, pages 262–279. Springer, 2002.
G. Greco, S. Greco, and E. Zumpano. A logic programming approach to the integration, repairing and querying of inconsistent databases. In Proc. 17th Int. Conf. on Logic Programming (ICLP 2001), volume 2237 of LNCS, pages 348–364. Springer, 2001.
G. Greco, S. Greco, and E. Zumpano. A logical framework for querying and repairing inconsistent databases. IEEE Trans. on Knowledge and Data Engineering, to appear.
D. Lembo, M. Lenzerini, and R. Rosati. Source inconsistency and incompleteness in data integration. In Proc. 9th Int. Workshop on Knowledge Representation meets Databases (KRDB 2002), number 54 in CEUR Workshop Proceedings, 2002.
J. Lin and A. O. Mendelzon. Merging databases under constraints. International Journal of Cooperative Information Systems, 7(1):55–76, 1998.
S.-H. Nienhuys-Cheng and R. de Wolf. The subsumption theorem in inductive logic programming: Facts and fallacies. In L. D. Raedt, editor, Advances in Inductive Logic Programming, pages 265–276. IOS Press, 1996.
G. D. Plotkin. A note on inductive generalization. In B. Meltzer and D. Michie, editors, Machine Intelligence 5, pages 153–163, Edinburgh, 1969. Edinburgh University Press.
P. R. J. van der Laag and S.-H. Nienhuys-Cheng. Completeness and properness of refinement operators in inductive logic programming. Journal of Logic Programming, 34(3):201–225, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wijsen, J. (2003). Condensed Representation of Database Repairs for Consistent Query Answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds) Database Theory — ICDT 2003. ICDT 2003. Lecture Notes in Computer Science, vol 2572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36285-1_25
Download citation
DOI: https://doi.org/10.1007/3-540-36285-1_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00323-6
Online ISBN: 978-3-540-36285-2
eBook Packages: Springer Book Archive