Abstract
Databases with integrity constraints (IC) are considered. For each DB update, i.e. a set of facts to add and of facts to delete, the IC implies its correct expansion: new facts to add and new facts to delete. Simultaneously, each expanded update induces a correct simplification of the IC. In the limit this sequence of expansions and simplifications converges to the maximal correct update expansion independent from the initial DB state.
We show that such maximal expansion is computed in square time for partial databases, and that its computation is a co-N P-complete problem in classical databases. However, it is also square time computable in classical DBs under ICs with some restrictions on the use of negation. Computing the real change of the initial DB state after accomplishing an update is a hard problem. The use of maximal update expansion in the place of initial update can substantially simplify computation of a new correct DB state.
This work was sponsored by the Russian Fundamental Studies Foundation (Grants 97-01-00973, 98-01-00204, 99-01-00374).
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.: Updates a new Frontier. In: Proc. of the Second International Conference on the Theory of Databases, ICDT’88. LNCS 326 (1988) 1–18.
Alferes, J.J., Pereira, L.M.: Update-Programs Can Update Programs. In: J. Dix, L.M. Pereira, T.C. Przymusinski, editors: Second International Workshop, NMELP’96. Selected Papers. LNCS 1216 (1997) 110–131.
Chitta Baral and Michael Gelfond: Logic programming and knowledge representation. Journal of Logic Programming, 12:1–80, 1994.
Bonner, A.J., Kifer, M.: An Overview of Transaction Logic. Theoretical Computer Science, 133(2) (1994), 2-5-265.
Decker H.: An extension of SLD by abduction and integrity maintenance for view updating in deductive databases. In: Proc. of the 1996 International Conference on Logic Programming. MIT Press, (1996), 157–169.
Dekhtyar, M., Dikovsky, A., Spyratos, N.: On Conservative Enforced Updates. In: Dix, J., Furbach, U., Nerode, A., editors: Proceedings of 4th International Conference, LPNMR’97. Dagstuhl Castle, Germany, LNCS 1265 (1997) 244–257.
Dekhtyar, M., Dikovsky, A., Spyratos, N.: On Logically Justified Updates. In: J. Jaffar, editor: Proc. of the 1998 Joint International Conference and Symposium on Logic Programming. MIT Press, (1998), 250–264.
Dekhtyar, M., Dikovsky, A., Dudakov S., Spyratos, N.: Monotone expansion of updates in logical databases. To be published in the Proc. of LPNMR’99.
Eiter, T., Gottlob, G.: On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence. 57 (1992) 227–270.
Eshghi, K., Kowalski, R. A.: Abduction Compared with Negation by Failure. In: Proc. of the 1989 International Conference on Logic Programming. (1989)
Gelfond, M., Lfschitz, V.: The stable semantics for logic programs. In: R. Kovalsky and K. Bowen, editors, Proc. of the 5th Intern. Symp. on Logic Programming. Cambridge, MA, MIT Press (1988) 1070–1080.
Guessoum A., Lloyd J.W.: Updating knowledge bases. New Generation Computing. 8 (1990), 71–89.
Halfeld Ferrari Alves, M., Laurent, D., Spyratos, N., Stamate, D.: Update rules and revision programs. Rapport de Recherche Université de Paris-Sud, Centre d’Orsay, LRI 1010 (12 / 1995).
Hanson, E.N., Widom, J., An Overview of Production Rules in Database Systems. The Knowledge Engineering Review. 8 (1993), N. 2, 121–143.
Kakas A.C., Mancarella P.: Database updates through abduction. In: Proc. 16th VLBD Conference. (1990) 650–661.
Vladimir Lifschitz: Foundations of logic programming. In: Gerhard Brewka, editor, Principles of Knowledge Representation, pages 69–128. CSLI Publications, 1996.
Lloyd, J.W., Foundations of Logic Programming. Second, Extended Edition. Springer-Verlag. (1993)
Marek, V.W., Truszcińsky, M.: Revision programming, database updates and integrity constraints. In: International Conference on Data Base theory, ICDT. LNCS 893 (1995) 368–382.
Przymusinski, T.C., Turner, H.: Update by Means of Inference Rules. In: V.W. Marek, A. Nerode, M. Truszczyński, editors, Logic Programming and Non-monotonic Reasoning. Proc. of the Third Int. Conf. LPNMR’95, Lexington, KY, USA (1995) 166–174.
Tomasic A.: View update translation via deduction and annotation. In: Proc. of the Second International Conference on the Theory of Databases, ICDT’88. LNCS 326 (1988) 338–352.
Van Gelder, A., Ross, K.A., and Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. Journal of the ACM. 38 (1991) 620–650.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dekhtyar, M., Dikovsky, A., Dudakov, S., Spyratos, N. (2000). Maximal Expansions of Database Updates. In: Schewe, KD., Thalheim, B. (eds) Foundations of Information and Knowledge Systems. FoIKS 2000. Lecture Notes in Computer Science, vol 1762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46564-2_5
Download citation
DOI: https://doi.org/10.1007/3-540-46564-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67100-8
Online ISBN: 978-3-540-46564-5
eBook Packages: Springer Book Archive