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!
If the deletion violates referential integrity constraint, then three alternatives are available:
Example:
Let R:
A#
B
C^
A1
B1
C1
A2
B3
C3
A3
B4
A4
C5
Q
C#
D
D1
D2
D3
Note:
1) '#' shows the Primary key of a relation.
2) '^' shows the Foreign key of a relation.
(1) Delete a tuple with C# = 'C1' in Q.
Violated constraint: - Referential Integrity constraint
Motive: - Tuples in relation A refer to tuple in Q.
Dealing: - Options available are
1) Decline the deletion.
2) DBMS may automatically delete all tuples from relation S and Q with C
# = 'C1'. This is known as cascade detection.
3) The one more option would result in putting NULL value in R where C1 exist, which is the initial tuple R in the attribute C.
You will be analysing a set of financial data of your choice. It is not necessary to collect any primary data of your own, and publicly available secondary data will be sufficient
Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is: If R has m tuples and S has n tuples then maximum siz
Differentiate OO development from structured development. Structured approach of problem solving is based upon the idea of decomposition of system into subsystem. In this appro
how to construct labelled precedence graph for view serialiability.please explain insteps with one solved examples
Optimistic Concurrency Control Is locking the only way to stop concurrency related problems? There exist some other ways too. One such way is known as an Optimistic Concurrency
HOW MANY TYPES OF VIEWS
How is Oracle used in PL/SQL? Define the features of process and how they are defined? PL/SQL - PL/SQL is Oracle's procedural language (PL) superset of the Structured
Explain the Dynamic Hashing Techniques There are two methods in it: extendible hashing - stores an access structure in addition to the file, and therefore is somewhat identica
Define seek time. The time for repositioning the arm is known as the seek time and it enhances with the distance that the arm is known as the seek time.
Project Description: I would like to get a database of a website which has clients email name and phone number. If you are able to get information from a website, by entering
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