Abstract
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. Using the framework proposed by Arenas, Bertossi, and Chomicki [5], we focus on two basic computational issues: repair checking (is a database instance a repair of a given database?) and consistent query answers (is a tuple an answer to a given query in every repair of a given database?). We study the computational complexity of both problems, delineating the boundary between the tractable and the intractable. We review relevant semantical issues and survey different computational mechanisms proposed in this context. Our analysis sheds light on the computational feasibility of minimal-change integrity maintenance. The tractable cases should lead to practical implementations. The intractability results highlight the inherent limitations of any integrity enforcement mechanism, e.g., triggers or referential constraint actions, as a way of performing minimal-change integrity maintenance.
This material is based upon work supported by the National Science Foundation under Grant No. IIS-0119186 and UB start-up funds.
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
Abiteboul, O., Duschka, O.: Complexity of Answering Queries Using Materialized Views. In: ACM Symposium on Principles of Database Systems (PODS), pp. 254–263 (1998)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Agarwal, S., Keller, A.M., Wiederhold, G., Saraswat, K.: Flexible Relation: An Approach for Integrating Data from Multiple, Possibly Inconsistent Databases. In: IEEE International Conference on Data Engineering (ICDE), pp. 495–504 (1995)
Arenas, M., Bertossi, L., Chomicki, J., He, X., Raghavan, V., Spinrad, J.: Scalar Aggregation in Inconsistent Databases. Theoretical Computer Science 296(3), 405–434 (2003)
Arenas, M., Bertossi, L., Chomicki, J.: Consistent Query Answers in Inconsistent Databases. In: ACM Symposium on Principles of Database Systems (PODS), pp. 68–79 (1999)
Arenas, M., Bertossi, L., Chomicki, J.: Specifying and Querying Database Repairs Using Logic Programs with Exceptions. In: International Conference on Flexible Query Answering Systems (FQAS), pp. 27–41. Springer, Heidelberg (2000)
Arenas, M., Bertossi, L., Chomicki, J.: Scalar Aggregation in FD-Inconsistent Databases. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 39–53. Springer, Heidelberg (2000)
Arenas, M., Bertossi, L., Chomicki, J.: Answer Sets for Consistent Query Answering in Inconsistent Databases. Theory and Practice of Logic Programming 3(4–5), 393–424 (2003)
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)
Baral, C., Kraus, S., Minker, J., Subrahmanian, V.S.: Combining Knowledge Bases Consisting of First-Order Theories. Computational Intelligence 8, 45–71 (1992)
Barcelo, P., Bertossi, L.: Repairing Databases with Annotated Predicate Logic. In: Benferhat, S., Giunchiglia, E. (eds.) Ninth International Workshop on Non- Monotonic Reasoning (NMR 2002), Special Session: Changing and Integrating Information: From Theory to Practice, pp. 160–170 (2002)
Barcelo, P., Bertossi, L.: Logic Programs for Querying Inconsistent Databases. In: Dahl, V., Wadler, P. (eds.) PADL 2003. LNCS, vol. 2562, pp. 208–222. Springer, Heidelberg (2002)
Bertossi, L., Chomicki, J., Cortes, A., Gutierrez, C.: Consistent Answers from Integrated Data Sources. In: Andreasen, T., Motro, A., Christiansen, H., Larsen, H.L. (eds.) FQAS 2002. LNCS (LNAI), vol. 2522, pp. 71–85. Springer, Heidelberg (2002)
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)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)
Bravo, L., Bertossi, L.: Logic Programs for Consistently Querying Data Integration Systems. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 10–15 (2003)
Bry, F.: Query Answering in Information Systems with Integrity Constraints. In: IFIP WG 11.5 Working Conference on Integrity and Control in Information Systems, pp. 113–130. Chapman &Hall, Boca Raton (1997)
Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.: Keys for XML. Computer Networks 39(5), 473–487 (2002)
Cali, A., Lembo, D., Rosati, R.: On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases. In: ACM Symposium on Principles of Database Systems (PODS), pp. 260–271 (2003)
Cali, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data intergation systems. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 16–21 (2003)
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 (LNAI), vol. 1861, pp. 942–956. Springer, Heidelberg (2000)
Chakravarthy, U.S., Grant, J., Minker, J.: Logic-Based Approach to Semantic Query Optimization. ACM Transactions on Database Systems 15(2), 162–207 (1990)
Chandra, A.K., Harel, D.: Computable Queries for Relational Databases. Journal of Computer and System Sciences 21, 156–178 (1980)
Chandra, A., Merlin, P.: Optimal Implementation of Conjunctive Queries in Relational Databases. In: ACM SIGACT Symposium on the Theory of Computing (STOC), pp. 77–90 (1977)
Chomicki, J., Marcinkowski, J., Staworko, S.: Computing Consistent Query Answers Using Conflict Hypergraphs (submitted, 2004)
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)
Chomicki, J., Marcinkowski, J.: On the Computational Complexity of Consistent Query Answers. Technical Report arXiv:cs.DB/0204010, arXiv.org e-Print archive (April 2002)
Chomicki, J., Marcinkowski, J.: Minimal-Change Integrity Maintenance Using Tuple Deletions. Information and Computation (2004) (To appear Earlier version: Technical Report cs.DB/0212004, arXiv.org e-Print archive)
Chou, T., Winslett, M.: A Model-Based Belief Revision System. Journal of Automated Reasoning 12, 157–208 (1994)
Dalal, M.: Investigations into a Theory of Knowledge Base Revision. In: National Conference on Artificial Intelligence, St.Paul, Minnesota (August 1988)
Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming. ACM Computing Surveys 33(3), 374–425 (2001)
Dung, P.M.: Integrating Data from Possibly Inconsistent Databases. In: International Conference on Cooperative Information Systems (COOPIS), Brussels, Belgium, pp. 58–65. IEEE Press, Los Alamitos (1996)
Duschka, O.M., Genesereth, M.R., Levy, A.Y.: Recursive Query Plans for Data Integration. Journal of Logic Programming 43(1), 49–73 (2000)
Eiter, T., Fink, M., Greco, G., Lembo, D.: Efficient Evaluation of Logic Programs for Querying Data Integration Systems. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 163–177. Springer, Heidelberg (2003)
Eiter, T., Gottlob, G.: On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. Artificial Intelligence 57(2-3), 227–270 (1992)
Embury, S.M., Brandt, S.M., Robinson, J.S., Sutherland, I., Bisby, F.A., Gray, W.A., Jones, A.C., White, R.J.: Adapting integrity enforcement techniques for data reconciliation. Information Systems 26(8), 657–689 (2001)
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)
Fan, W., Kuper, G., Simeon, J.: A Unified Constraint Model for XML. Computer Networks 39(5), 489–505 (2002)
Fan, W., Simeon, J.: Integrity Constraints for XML. Journal of Computer and System Sciences 66(1), 254–291 (2003)
Flesca, S., Furfaro, F., Greco, S., Zumpano, E.: Repairs and Consistent Answers for XML Data with Functional Dependencies. In: Bellahsène, Z., Chaudhri, A.B., Rahm, E., Rys, M., Unland, R. (eds.) XSym 2003. LNCS, vol. 2824, pp. 238–253. Springer, Heidelberg (2003)
Fuxman, A., Miller, R.: Towards Inconsistency Management in Data Integration Systems. In: IJCAI 2003 Workshop on Information Integration on the Web, IIWeb 2003 (2003)
Gärdenfors, P., Rott, H.: Belief Revision. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 4, pp. 35–132. Oxford University Press, Oxford (1995)
Giannotti, F., Greco, S., Sacca, D., Zaniolo, C.: Programming with Nondeterminism in Deductive Databases. Annals of Mathematics and Artificial Intelligence 19(3-4) (1997)
Giannotti, F., Pedreschi, D.: Datalog with Non-deterministic Choice Computes NDB-PTIME. Journal of Logic Programming 35, 75–101 (1998)
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)
Greco, G., Greco, S., Zumpano, E.: A Logical Framework for Querying and Repairing Inconsistent Databases. IEEE Transactions on Knowledge and Data Engineering 15(6), 1389–1408 (2003)
Greco, S., Sacca, D., Zaniolo, C.: Datalog Queries with Stratified Negation and Choice: from P to DP. In: Vardi, M.Y., Gottlob, G. (eds.) ICDT 1995. LNCS, vol. 893, pp. 82–96. Springer, Heidelberg (1995)
Greco, S., Sirangelo, C., Trubitsyna, I., Zumpano, E.: Preferred Repairs for Inconsistent Databases. In: International Database Engineering and Applications Symposium (IDEAS), pp. 202–211. IEEE Computer Society Press, Los Alamitos (2003)
Greco, S., Zumpano, E.: Querying Inconsistent Databases. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol. 1955, pp. 308–325. Springer, Heidelberg (2000)
Halevy, A.Y.: Answering Queries Using Views: A Survey. VLDB Journal 10(4), 270–294 (2001)
Hochbaum, D.S.: Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems. PWS Publishing Co. (1997)
Imieliński, T., Lipski, W.: Incomplete Information in Relational Databases. Journal of the ACM 31(4), 761–791 (1984)
Imieliński, T., Naqvi, S., Vadaparty, K.: Incomplete Objects - A Data Model for Design and Planning Applications. In: ACM SIGMOD International Conference on Management of Data, Denver, Colorado, May 1991, pp. 288–297 (1991)
Imieliński, T., van der Meyden, R., Vadaparty, K.: Complexity Tailored Design: A New Design Methodology for Databases With Incomplete Information. Journal of Computer and System Sciences 51(3), 405–432 (1995)
Kanellakis, P.C.: Elements of Relational Database Theory. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 17, vol. B, pp. 1073–1158. Elsevier/MIT Press (1990)
Lembo, D., Lenzerini, M., Rosati, R.: Source Inconsistency and Incompleteness in Data Integration. In: 9th International Workshop on Knowledge Representation meets Databases (KRDB 2002), Toulouse, France (2002)
Lenzerini, M.: Data Integration: A Theoretical Perspective. In: ACM Symposium on Principles of Database Systems (PODS), pp. 233–246 (2002) (invited talk)
Lin, J., Mendelzon, A.O.: Merging Databases under Constraints. International Journal of Cooperative Information Systems 7(1), 55–76 (1996)
Ludäscher, B., May, W., Lausen, G.: Referential Actions as Logical Rules. In: ACM Symposium on Principles of Database Systems (PODS), pp. 217–227 (1997)
Melton, J., Simon, A.R.: SQL:1999 Understanding Relational Language Components. Morgan Kaufmann, San Francisco (2002)
van der Meyden, R.: Logical Approaches to Incomplete Information: A Survey. In: Chomicki, J., Saake, G. (eds.) Logics for Databases and Information Systems, ch. 10, pp. 307–356. Kluwer Academic Publishers, Boston (1998)
Van Nieuwenborgh, D., Vermeir, D.: Preferred Answer Sets for Ordered Logic Programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 432–443. Springer, Heidelberg (2002)
Vardi, M.Y.: The Complexity of Relational Query Languages. In: ACM Symposium on Theory of Computing (STOC), pp. 137–146 (1982)
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)
Winslett, M.: Reasoning about Action using a Possible Models Approach. In: National Conference on Artificial Intelligence, pp. 79–83 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chomicki, J., Marcinkowski, J. (2005). On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational Databases. In: Bertossi, L., Hunter, A., Schaub, T. (eds) Inconsistency Tolerance. Lecture Notes in Computer Science, vol 3300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30597-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-30597-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24260-4
Online ISBN: 978-3-540-30597-2
eBook Packages: Computer ScienceComputer Science (R0)