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.
A step-wise distributed database design methodology Following is a step-wise methodology for distributed database design. (1) Examine the nature of distribution. Find out wh
Types Of Indexes One of the words used during the file organisation is the term index. In this part, let us describe this term in more detail. We find the index of keywords
The Enhanced Entity Relationship Diagram (ERD) produced with a drawing or case tool. Your EERD must use a ''standard'' notation style such as Crows Foot or Chen. Please note that t
A use case diagram giving a pictorial overview of user requirements and brief use case descriptions. As the case study contains only an outline of a business scenario, you will als
What are the various properties of Relational tables? Relational tables have 6 properties: 1. Each row is unique. 2. Column values are of the same kind. 3. Values are
What is OLTP (Online Transaction Processing)? In OLTP - online transaction processing systems relational database design use the discipline of data modeling and generally follo
ddlc
Describe logical data independence ? Logical Data Independence - It is the capacity to modify the conceptual schema without having to change external schemas or application p
multiplicity constarin
Consider the following relations: BRANCH( bno, street, area, city, pcode, Tel_no, Fax_no) STAFF( Sno, Fname, Lname, address, position , salary, bno) Express the subsequent 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