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.
What is DataWarehousing? Subject-oriented, meaning that the data in the database is organized so that all the data elements relating to the similar real-world event or object
A step-wise distributed database design methodology Following is a step-wise methodology for distributed database design. (1) Examine the nature of distribution. Find out wh
You group has been hired by TrainingrUs.com to keeps track of training revenues. TrainingrUS.com wants you to keep scheduling. COURSE table contains following information:
What are wait-for-graphs?Give the algorithm to construct a wait-for-graph from a given schedule of transactions? How can deadlocks be detected from wait-for-graphs? Ans: The
What is the use of a slotted-page structure and what is the information are there in the header? The slotted-page structure is used for organizing records within a one block.
Question 1: (a) Explain the legal meaning of :- (i) Computer Service Person (ii) Data holding (b) Explain how the law ensures Data protection and Security. Qu
HOW TO SOLVE THE LP Problems by simplex method?z=x1+-3x2+2x3
Let us first describe the term relationships. What Are Relationships? A relationship can be defined as: A set of associations or connection, or A rule for communic
After going by the database architecture, let us now dwell on an important query: how is the data organised in a database? There are a lot of basic structures that exist in a datab
explain participation constraints with examples
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