Propagation constraint: Difference between revisions

Revision as of 13:27, 10 January 2006

Revision as of 21:16, 4 March 2006

Line 1:

{{context}}

According to [[Beynon-Davies]] (2004, p.108) "''[a] propagation constraint details what should happen to a related table when we update a row or rows of a target table''". He further states that for all [[relationship]]s, one should define how to handle deletions of target and related [[tuple]]s. There are three possibilities:

* Restricted Delete - cannot delete the target row until all rows that point to it (via [[foreign key]]s) have been deleted.