Abstract
Recently there has been an increasing interest in integrity constraints associated with relational databases and in inconsistent databases, i.e. databases which do not satisfy integrity constraints. In the presence of inconsistencies two main techniques have been proposed: compute repairs, i.e. minimal set of insertion and deletion operations, called database repairs, and compute consistent answers, i.e. identify the sets of atoms which we can assume true, false and undefined without modifying the database. In this paper feasibility conditions and preference criteria are introduced which, associated with integrity constraints, allow to restrict the number of repairs and to increase the power of queries over inconsistent databases. Moreover, it is studied the complexity of computing repairs and the expressive power of relational queries over databases with integrity constraints, feasibility conditions and preference criteria.
The first author is also supported by ICAR-CNR and Exeura Srl.
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.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1994)
Argaval, S., Keller, A.M., Wiederhold, G., Saraswat, K.: Flexible Relation: an Approach for Integrating Data from Multiple, Possibly Inconsistent Databases. In: ICDE (1995)
Arenas, M., Bertossi, L., Chomicki, J.: Consistent Query Answers in Inconsistent Databases. In: PODS, pp. 68–79 (1999)
Arenas, M., Bertossi, L., Chomicki, J.: Specifying and Querying Database repairs using Logic Programs with Exceptions. In: FQAS, pp. 27–41 (2000)
Brewka, G., Eiter, T.: Preferred Answer Sets for Extended Logic Programs. AI 109(1-2), 297–356 (1999)
Cali, A., Calvanese, D., De Giacomo, G., Lenzerini, M.: Data Integration under Integrity Constraints. In: Pidduck, A.B., Mylopoulos, J., Woo, C.C., Ozsu, M.T. (eds.) CAiSE 2002. LNCS, vol. 2348, pp. 262–279. Springer, Heidelberg (2002)
Cali, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: PODS, pp. 260–271 (2003)
Chomicki, J.: Querying with Intrinsic Preferences. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 34–51. Springer, Heidelberg (2002)
Dung, P.M.: Integrating Data from Possibly Inconsistent Databases. CoopIS (1996)
Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM Transactions on Database Systems 22(3), 364–418 (1997)
Greco, S., Saccà , D.: Search and Optimization Problems in Datalog. In: Computational Logic: Logic Programming and Beyond, pp. 61-82 (2002)
Greco, S., Zumpano, E.: Querying Inconsistent Database LPAR Conf., pp. 308-325 (2000)
Greco, G., Greco, S., Zumpano, E.: A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases. In: ICLP Conf., pp. 348–364 (2001)
Greco, G., Greco, S., Zumpano, E.: A Logical Framework for Querying and Repairing Inconsistent Databases. IEEE Trans. Knowl. Data Eng 15(6), 1389–1408 (2003)
Greco, S., Sirangelo, C., Trubitsyna, I., Zumpano, E.: Preferred Repairs for Inconsistent Databases. In: IDEAS Conf., pp. 202–211 (2003)
Grant, J., Subrahmanian, V.S.: Reasoning in Inconsistent Knowledge Bases. TKDE 7(1), 177–189 (1995)
Johnson, D.S.: A Catalog of Complexity Classes. In: van Leewen, J. (ed.) Handbook of Theoretical Computer Science, vol. 1, North-Holland, Amsterdam (1990)
Lin, J.: A Semantics for Reasoning Consistently in the Presence of Inconsistency. Artificial Intelligence 86(1), 75–95 (1996)
Marek, V.W., Truszczynski, M.: Revision Programming. Theoretical Computer Science 190(2), 241–277 (1998)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Sakama, C., Tnoue, K.: Priorized logic programming and its application to commonsense reasoning. Artificial Intelligence (123), 185–222 (2000)
Selman, A.: A taxonomy of complexity classes of functions. JCSS 48, 327–381 (1994)
Ullman, J.K.: Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, Rockville (1988)
Wijsen, J.: Condensed Representation of Database Repairs for Consistent Query Answering. In: ICDT, pp. 378–393 (2003)
Zang, Y., Foo, N.: Answer sets for prioritized logic programs. In: ILPS, pp. 69–83 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greco, S., Sirangelo, C., Trubitsyna, I., Zumpano, E. (2004). Feasibility Conditions and Preference Criteria in Querying and Repairing Inconsistent Databases. In: Galindo, F., Takizawa, M., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2004. Lecture Notes in Computer Science, vol 3180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30075-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-30075-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22936-0
Online ISBN: 978-3-540-30075-5
eBook Packages: Springer Book Archive