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

Define view? how it is related to data independence, A View may be defi...

A View may be defined of as a virtual table, that is, a table that does not really exist in its own right but is instead inferred from one or more underlying base data table. T

Give expression in both tuple calculus and domain calculus, Consider the fo...

Consider the following relational schema: Doctor(DName,Reg_no) Patient(Pname, Disease) Assigned_To (Pname,Dname) Give expression in both Tuple calculus and Domain calculus for

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

Describe participation constraints, Describe Participation Constraints? ...

Describe Participation Constraints? Participation Constraints - The participation constraint exacts whether the existence of an entity depends on its being related to another

Improved performance, Improved performance: As the data is located near the...

Improved performance: As the data is located near the site of its demand, and given the inherent parallelism because of multiple copies, speed of database access may be good for di

B+ tree, construct a B+ tree for the following set of key value (2,3,5,7,11...

construct a B+ tree for the following set of key value (2,3,5,7,11,19,23,29,31) in ascending order where the pointers that will fit in one node is as follows:A. four B. six C. eigh

DBMS, what is specialization?

what is specialization?

Write query to list the staff who work within the branch, Consider the foll...

Consider the following relations: BRANCH( bno, street, area, city, pcode, Tel_no, Fax_no) STAFF( Sno, Fname, Lname, address, position , salary, bno) Express the subsequent qu

Give the general form of sql query, Give the general form of SQL query? ...

Give the general form of SQL query? Select  A1, A2............., An From  R1, R2..............., Rm Where  P

What is the need for triggers, What is the need for triggers? Triggers ...

What is the need for triggers? Triggers are useful mechanisms for alerting humans or for starting particular tasks automatically when particular conditions are met.

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