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.
Compare the two log-based recovery schemes in terms of ease of implementation and overhead cost. Ans: There are two types of log based recovery techniques: deferred update
what are the type of the database
How to create a biological database based on viruses. How to decide which attribute should be there in the table and schema? How to identify the primary keys, foreign keys, domain,
What is a view? Make a view of EMP table named DEPT 20, to display the employees in department 20 and their annual salary. Ans: View is a virtual table that does not consist
Explain the Management of Data Store Every system irrespective of its nature of application requires storing permanent data for consequent use in problem solving. Some objects
Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as
#question benefits and limitations of data models..
Define rotational latency time. The time spent waiting for the sector to be accessed to appear under the head is known as the rotational latency time.
Define data conversion? Helpful to load data into temporary staging tables. Then can write SQL code to do much of data processing. SQL code is simpler and faster to write than
Question : (a) Database Management Systems (DBMS) is the foundation of business intelligence. Explain the following concepts related to DBMS: (i) Entity Relationship Diagr
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