Discuss the types of integrity constraints with example, Database Management System

Assignment Help:

Discuss the types of integrity constraints in which must be checked for the update operations - Insert and Delete. Give examples.

Insert operation can violet any of the subsequent four constraints:

1) Domain constraints could be violated if given attribute value does not appear within corresponding domain.
2) Key constraints could be violated if given attribute value does not appear within corresponding domain.
3) Entity integrity can be violated if the primary key of the latest tuple t is NULL.
4) Referential integrity can be violated if value of any foreign key in t refers to a tuple in which does not exist in referenced relation.

Delete operation can violate only referential integrity constraints, if the tuple being deleted is referenced through the foreign keys from other tuples within the database.


Related Discussions:- Discuss the types of integrity constraints with example

What is inheritance, What is inheritance? Define it in detail?  Inheri...

What is inheritance? Define it in detail?  Inheritance Inheritance can be at the levels of types, or at the level of tables we first consider inheritance of types, then i

DBMS , need a DBMS system on any data for assignment.

need a DBMS system on any data for assignment.

Design and building a distributed information system, The scenario You ...

The scenario You have been approached to design and implement a prototype of a distributed information system for a national car part retail outlet chain. The company comprises

What is recursive closure and operation relational algebra, What is recursi...

What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec

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

Lossless-join decomposition, Lossless-Join Decomposition   Let us sh...

Lossless-Join Decomposition   Let us show an intuitive decomposition of a relation. We require a better basis for deciding decompositions since intuition may not always be r

Define the schema at the intermediate level of abstraction, Define Accordin...

Define According to the levels of abstraction, the schema at the intermediate level is called  Ans: As per to the levels of abstraction, the schema at the intermediate level is

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