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 a B+-Tree index? A B+-Tree index takes the form of a balanced tree in which each path from the root of the root of the root of the tree to a leaf of the tree is of the
Question: One of the tasks a database management system must perform is to ensure that the data is still intact in the face of software and hardware failure. This task is known
Draw the database using the ER approach and then make the tables accordingly. Populate the tables so that every table have at least 10 tuples. Then using Java and SQL, execute the
What is horizontal fragmentation? Horizontal fragmentation divides the relation by assuming every tuple of r to one or more fragments
Inconsistent Analysis : The problem as given with transactions T1 and T2 where two transactions interleave to make incorrect result during an analysis by Audit is the instance of s
Describe substring comparison in SQL. For the relation Person (name, address), write a SQL query that retrieves the names of people whose name starts along with ‘A' and address co
Discuss along with examples about several types of attributes present in the ER model? Types of Attributes are: • SIMPLE attributes are attributes which are drawn from the ato
Rules Of Data Normalisation Let us now summarise Normalisation with the help of various clean rules. The following are the necessary rules for the Normalisation process: 1.
Differance between Unordered and ordered file ? Unordered file do no has any sequence although ordered file has arranged in a few sequence and data are assigned in ordered form
growing phase and shrinking phase are disjoint, why ?
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