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.
joins
Describe identifying relationship? Identifying relationship: It is relationship among strong entity and a weak entity it is represented through a doubly outlined diamond in C
Candidate Key: In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1) Uniqueness: N
what is stracture of dabms
What is self-transition? If there is a transition which goes back to same state, it is known as "self- transition." With a trigger action exit action would be executed f
Explain Deadlock detection and recovery Deadlock Detection - A deadlock is said to take place when there is a circular chain of transaction, every waiting for the release of a
Define check point and its impact on data base recovery. Ans: There could be hundreds of transactions handled per minute, in a large on-line database system.
External failure : A failure can also result because of an external cause, such as earthquakes, fire, floods, etc. The database must be duly backed up to avoid troubles occurring d
Project Description: We have purchased facebook style chat software which we are using with our site. It is prepared in PHP but the rest of the site is developed asp.net. Iss
What is the most significant feature that does not directly map into programming language structures? Why? Association, since there are complex types of association, like as qu
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