PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Asirelli P., Cacciatore G., Inverardi P., Musa D. Well-founded semantics for integrity constraints. In: 3rd Ercim Database Research Group Workshop on Updates and Constraints Handling in Advanced Database Systems. (Pisa, 28 - 30 September 1992). Proceedings, pp. 49 - 60. Patrizia Asirelli, Fosca Giannotti, Michele Missikoff, Ettore Ricciardi (eds.). ERCIM, 1992.
 
 
Abstract
(English)
In this paper we present a framework for consistency checking of a database witb respect to its integrity constraints, overcoming the restriction of considering stratified databases only. To reach this goal we have considered the well-founded and stable models semantics and then decided to use the well-founded one. The basic idea is that of finding the widest class of transactions for which it can be stated that the updated database D' satisfies the integrity constraints IC, without having to compute its entire well-founded model, WF(D'). To this purpose the concept of conservative transactions has been introduced and furthermore a method to compute a (suitable approximation of the) minimal subset of WF(D') that permits to decide the satisfiability of contraints is presented.
Subject Integrity Constraints


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional