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

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

Data integrity, You are required to implement integrity constraints within ...

You are required to implement integrity constraints within the database to enforce the following requirements: For Projects: Start date must be supplied. Start date cannot be i

What is class diagram, Class Diagram A class diagram is required to su...

Class Diagram A class diagram is required to support functional necessity of system. In a static design view, class diagram is used to model vocabulary of the system, simple c

Develop and evaluate partial systems, Part 1: Security Plan Consider th...

Part 1: Security Plan Consider the Case study and identify 3 security requirements. For each of these security requirements: • Discuss the necessity for the feature and how

Define decision tree classifiers, Define decision tree classifiers? As ...

Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as

Synonyms, Synonyms It allows short names or alternative names for objects....

Synonyms It allows short names or alternative names for objects. Example : CREATE SYNONYM D30 FOR EMPD30; Now if we give command:

Which is another name for weak entity, Which is another name for weak entit...

Which is another name for weak entity? Child is another name of weak entity.

Need for multiple access paths, Need for Multiple Access Paths In pract...

Need for Multiple Access Paths In practice, most of the online information systems need the support of multi-key files. For example, consider a banking database application hav

Datawarehouse, Explain four causes for failures in data warehouse projects

Explain four causes for failures in data warehouse projects

Define hot backup, Hot Backup: Some sites cannot terminate the database wh...

Hot Backup: Some sites cannot terminate the database while creating a backup copy of the files. The cold backup is not a reliable option. So different kinds of backing up database

Define identify relationship, Define identify relationship? Identifyin...

Define identify relationship? Identifying relationship: An identifying relationship means in which the child table cannot be uniquely recognize without the parent. For exampl

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages