Dealing with constraints violation, Database Management System

Assignment Help:

If the deletion violates referential integrity constraint, then three alternatives are available:

  • Default option: - refuse the deletion. It is the job of the DBMS to describe to the user why the deletion was rejected.
  • Attempt to propagate (or cascade) the deletion by deleting tuples that reference the tuple that is being deleted.
  • Vary the value of referencing attribute that origins the violation.

Example:

Let R:

A#

B

C^

A1

B1

C1

A2

B3

C3

A3

B4

C3

A4

B1

C5

Q

C#

D

C1

D1

C3

D2

C5

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.


Related Discussions:- Dealing with constraints violation

Normalization, Process of normalization is the integral part of designing a...

Process of normalization is the integral part of designing a database. Justify this statement with suitable database design

Identify the candidate keys, Consider the following six relation schemes an...

Consider the following six relation schemes and their corresponding sets of functional dependencies. In each case identify a. All the candidate keys b. The highest normal for

Explain how the associations are implemented as classes, Explain how the as...

Explain how the associations are implemented as classes. A general approach in this case is to transform an association class into a simple class linked to two original classes

Define 3nf normal form, 3NF Normal Form A relation schema R is in 3NF ...

3NF Normal Form A relation schema R is in 3NF if it is in 2NF and for each FD X A either of the following is true X is a Super-key of R. A is a prime attribute of R

Define query optimization, Define query optimization. Query optimizatio...

Define query optimization. Query optimization refers to the process of search the lowest -cost method of evaluating a given query.

What are the comparison operator in sql, What are the comparison operator i...

What are the comparison operator in SQL?  Comparison operator in SQL are =, LIKE and BETWEEN

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd