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.
A database for the Service and Maintenance (SM) section of a Computer sales and service Company has to be developed. SM gives after sales service to customers. SM branch has a numb
Question 1: Define the term business intelligence tools? Briefly explain how the data from one end gets transformed into information at the other end? Definition Exp
Create a view emp_dep containing e_name and number of dependents from the tables employee and dependent of (i) CREATE VIEW emp_dept AS SELECT ename, COUNT(*) FROM employee, dep
Consider the following database containing five transactions. Let min_sup = 60%. Mine all frequent itemsets using Apriori and FP-growth algorithm. Compare the efficiency of the t
distributed quey processing
Vertical Fragmentation- Vertical fragmentation groups together only those attributes in a relation that are used jointly by various important transactions. A vertical fragment is d
Explain heap file with advantages? Heap File is an unordered set or a group of records, stored on a set of pages. This class gives basic support for inserting, updating, select
Code an Oracle Database trigger to enforce the constraint that an employee can never change his or her department.
what are the reasons having variable length records
What is Management System? A management system is a set of rules and process which help us to create organize and manipulate the database. It also helps us to add, change delet
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