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 Built-in A notation of identity is built-into the data model or programming language and no user-supplied identifier is needed. This form of identity is used in objec
Information about films holds information about movies, stars and studios. Movies have a title, year of production, length and the film type. Stars have a name and address. Studi
Explain how the object classes are mapped to tables. Each object class maps to one or more than one tables in the database. The objects in the class may be partitioned horizont
Describe the storage structure of indexed sequential files and their access method. Ans: Storage structure of Indexed Sequential files and their access: To achieve fast rand
What is completeness constraint on generalization? Define the variation between total and partial design constraint. Give an example each. Ans: Completeness Constraints
Design an algorithm to implement operations Each and every operation specified in the functional model could be formulated as an algorithm. The algorithm indicates how operat
For every n-ary relationship type R where n>2, we make a new table S to represent R. We contain as foreign key attributes in s the primary keys of the relations that show the parti
What is inheritance? Define it in detail? Inheritance Inheritance can be at the levels of types, or at the level of tables we first consider inheritance of types, then i
Consider an information system designed for an online company which provides IT products and services These include desktops, laptops, networking products, IT books, parts, and
What is Data dictionary? A data dictionary is a reserved space in a database that is employed to store information about the database itself. A data dictionary may consist o
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