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

How are tables stored on disk?, How are tables stored on Disk? We reali...

How are tables stored on Disk? We realise that every record of a table can have different amounts of data. This is due to in some records; some attribute values may be "zero".

Explain the ansi sparc architecture, Explain the ANSI SPARC architecture ...

Explain the ANSI SPARC architecture The three-schema architecture is as well known as ANSI SPARC architecture. The aim of the three-schema architecture is to separate the user

What is predictive modelling, Problem: (a) Data mining is one of the b...

Problem: (a) Data mining is one of the best ways to analyse data and using software techniques, hidden and unexpected patterns and relationships in sets of data can be extrac

Data base design for a museum information system, In this practical assignm...

In this practical assignment, we will run through a complete database application development cycle, starting with the schema design, from an initial data import to database applic

Forward recovery (redo), Forward Recovery (Redo): In this system the commit...

Forward Recovery (Redo): In this system the committed changes made by a transaction are reapplied to a previous copy of the database.                          In simpler

Ordering of tuples, In a relation, tuples are not inserted in any definite ...

In a relation, tuples are not inserted in any definite order. Ordering of tuples is not defined as a part of a relation definition. Though, records may be structured later accordin

Create a technology web server, Database design Database tables will be...

Database design Database tables will be created for you on the Technology web server. The schema will be as follows. Please note that this is a simplified database structure, d

The locking protocol, The Locking Protocol: To manage concurrency related ...

The Locking Protocol: To manage concurrency related problems we use locking. A lock is mainly a variable that is associated with a data item in the database. A lock can be located

Increased parallelism-data replication, Increased parallelism : Since the r...

Increased parallelism : Since the replicated date has several copies a query can be distributed or can be answered from the smallest loaded site. Also, with more replicas you have

Views, what is view?explain

what is view?explain

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