Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Explain Foreign Key? Foreign Key - Let there are two relations (tables) R and S. Any candidate key of the relation R that is referred within the relation S is known as the fo
How do I begin
Problem 1. Create a PL/SQL program to insert data into student table and display the details of the student having Reg.No 1010 Writing a PL/SQL program to Insert data
Strict 2PL :Though, this basic 2PL suffers from the trouble that it can result into loss of isolation / atomic property of transaction as theoretically speaking once a lock is rele
Adding Redundant Associations for Efficient Access Redundant associations do not add any type of information, therefore during design we should actually examine structure of o
What is Nested Trigger? A trigger can also having INSERT, UPDATE and DELETE logic within itself, so when the trigger is fired because of data modification it can also cause ano
Explain the utilities which help the DBA to manage the database? Every DBA uses database utilities to maintain and control their databases. But there is a lot of confusion wit
Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?
construct a b-tree for the following set of key values 2,3,5,7,11,17,19,23,29,31.assume that the tree is initial empty and the values are added in ascending order
Dirty Reads: T10 reads a value which is updated by T9. This update has not been committed and T9 aborts. T9 T10 Value of x old value = 200
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd