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

State the objectives-data source, You will be analysing a set of financial ...

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

Join relation of two tuples, Consider the join of a relation R with relatio...

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., Differentiate OO...

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

View serialiabilty-labelled precedence graph, how to construct labelled pre...

how to construct labelled precedence graph for view serialiability.please explain insteps with one solved examples

Optimistic concurrency control, Optimistic Concurrency Control Is locki...

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 is oracle used in pl/sql, How is Oracle used in PL/SQL? Define the feat...

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, Explain the Dynamic Hashing Techniq...

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, Define seek time. The time for repositioning the arm ...

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.

I want to get database of a website, Project Description: I would like t...

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

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