Delete - referential integrity, Database Management System

Assignment Help:

During the deletion of a tuple two cases can happen:

Deletion of tuple in relation having the foreign key: In this type of case simply delete the desired tuple. For example, in ASSIGNMENT relation we can simply delete the first tuple.

Deletion of the target of a foreign key reference: For instance, an attempt to delete an employee tuple in EMPLOYEE relation whose EMPID is 101. This employee shown not only in the EMPLOYEE but also in the ASSIGNMENT relation. Can these tuple be deleted? If we delete the tuple in EMPLOYEE relation then two unequalled tuples are left in the ASSIGNMENT relation, therefore causing violation of referential integrity constraint. Therefore, the following two choices be for such deletion:

RESTRICT - The delete operation is "restricted" to only the situation where there are no such matching tuples.    For instance, we can delete the EMPLOYEE record of EMPID 103 as there is no matching tuple in ASSIGNMENT but not the record of EMPID 101.

CASCADE - The delete operation "cascades" to delete also those matching tuple. For  instance,  if  the  delete  mode  is  CASCADE  then  deleting  employee  having

EMPID as 101 from EMPLOYEE relation will also make deletion of 2 more tuples from ASSIGNMENT relation.


Related Discussions:- Delete - referential integrity

.DBMS, please describe the data base management with the easy example &giv...

please describe the data base management with the easy example &give the application?

Determine the strong and weak entity, Determine the Strong and Weak Entity ...

Determine the Strong and Weak Entity Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and a

Assignment SQL Management Server 2012, Have database built but having probl...

Have database built but having problems with some questions that go with the database

Define an operator that a relational algebra does not have, Define an opera...

Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.

Data manipulation language, Question 1 Discuss about second normal form an...

Question 1 Discuss about second normal form and third normal form Question 2 Write short note on                        1) Data Manipulation Language 2) Data Definition La

Mixed fragmentation, Mixed fragmentation: Sometimes, horizontal fragmentati...

Mixed fragmentation: Sometimes, horizontal fragmentation or vertical fragmentation of a database schema by itself is insufficient to sufficiently distribute the data for some appli

What is known as a search key, What is known as a search key? An attrib...

What is known as a search key? An attribute or set of attributes used to look up records in a file is known as a search key.

Weak entity, Entity types that do not have any key attribute, and therefore...

Entity types that do not have any key attribute, and therefore cannot be identified independently, are known as weak entity types. A weak entity can be recognized uniquely only by

Fragmentation-design of distributed databases, Fragmentation: It is defini...

Fragmentation: It is definite as partitioning of a relation into various fragments.Every fragment can be stored at a dissimilar site.

Distributed control and data sharing , Distributed Control and Data sharing...

Distributed Control and Data sharing: The geographical distribution of an organization can be showed in the distribution of the data; if a number of different sites are linked to e

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd