Key constraint - relational constraints, Database Management System

Assignment Help:

This constraint shows that the key attribute value in each tuple must be unique, i.e., no two tuples have the similar value for the key attribute. This is because the value of the primary key is used to recognize the tuples in the relation.

 

Example: If A is the key attribute in the following relation R than A1, A2 and A3 must be unique.

 

A

 

B

 

A1

 

B1

 

A3

 

B2

 

A2

 

B2

 

Example: In relation PERSON, PERSON_ID is primary key so PERSON_ID cannot be given as the similar for two persons.

Integrity Constraint

There are two kinds of integrity constraints:

  • Entity Integrity Constraint
  • Referential Integrity Constraint

Related Discussions:- Key constraint - relational constraints

Explain projection operation distribute over union operation, Illustrate th...

Illustrate the statement 'Projection operation distributes over the union operation'. Give an example.    Ans: Π L (E 1 ∪ E 2 ) = (Π L (E 1 )) ∪ (Π L (E 2 ))   This says th

Explain current page table and shadow page table, Explain current page tabl...

Explain current page table and shadow page table. The key idea behind the shadow paging method is to maintain two page tables during the life of the transaction: the current pa

Mis, explain various steps uses in evaluation and maintenance of MIS.

explain various steps uses in evaluation and maintenance of MIS.

Vertical fragmentation, Vertical Fragmentation- Vertical fragmentation grou...

Vertical Fragmentation- Vertical fragmentation groups together only those attributes in a relation that are used jointly by various important transactions. A vertical fragment is d

Structure of client server systems, Structure of Client Server Systems: In ...

Structure of Client Server Systems: In client/server architecture, clients show users who require services while servers give services. Both client and server are a combination of

Explain naivebayessimple algorithem, Use the IRIS dataset that comes with W...

Use the IRIS dataset that comes with Weka to compare the classification performance of the following algorithms. 1. NaiveBayesSimple 2. MultiLayerPerceptron J48 (

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

Give a sample of the dynamic model, Give a sample of the Dynamic Model. ...

Give a sample of the Dynamic Model. The sample of dynamic model is given below:  Dynamic model for the car: Brake and Accelerator            Brake or Applies Accelerator

Which two files are used during operation of the dbms, Which two files are ...

Which two files are used during operation of the DBMS? Data dictionary and transaction log are two files used during operation of the DBMS.

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