Propagation constraint: Difference between revisions

Revision as of 20:49, 2 December 2012

Latest revision as of 04:55, 27 April 2023

(One intermediate revision by one other user not shown)

Line 3:

Propagation constraints are methods used by [[relational database management system]]s (RDBMS) to solve this problem by ensuring that relationships between tables are preserved without error. In his database textbook, Beynon-Davies explains the three ways that RDBMS handle deletions of target and related [[tuple]]s:

* '''Restricted Delete''' - the user cannot delete the target row until all rows that point to it (via [[foreign key]]s) have been deleted. This means that all Housewares employees would need to be deleted, or their departments changed, before removing the department from the departmental table.

* '''Cascades Delete''' - can delete the target row and all rows that point to it (via foreign keys) are also deleted. The process is the same as a restricted delete, except that the RDBMS would delete the Houseware employees automatically before removing the department.

* '''Nullifies Delete''' - can delete the target row and all foreign keys (pointing to it) are set to [[Null (SQL)|null]]. In this case, after removing the housewares department, employees who worked in this department would have a [[Null (SQL)|NULL]] (unknown) value for their department.

==Bibliography==

Line 11:

[[Category:Relational database management systems]]

{{Compu-stub}}