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.
What are the problems if one were not to normalize? When do these problems surface? Ans: Database normalization, sometimes considered to as canonical synthesis, is
Special comparison operator used in where Clause a. between. ...and...It gives range among two values (inclusive) Example: SELECT ENAME, SAL FROM EMP WHERE SAL BETWE
Explain Object oriented Model ? Object Oriented Model - This model is based on the object-oriented programming language paradigm. It involves the features of OOP such as inhe
Distributed Database Management System
What are the two types of serializability? The two types of serializability is a) Conflict serializability b) View serializability
Table Handling In RDBMS more than one table can be tackled at a time by using join operation. Join operation is a relational operation that causes 2 tables with a common domai
what problems are raised by the database? why is it so controversial? why is data quality an issue?
Difference between SQL and SQL*Plus SQL SQL*Plus SQL is a language SQL *Plus is an environment It is bas
The Structured Query Language INTRODUCTION Database is an organised set of information about an entity having controlled redundancy and serves numerous applications. DBMS
Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every
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