GITTA-Logo
PDF Version of this document Search Help Glossary

Lesson Navigation IconRelationales Datenmodell

Unit Navigation IconKonzepte

Unit Navigation IconAbbildung ER-Schema

Unit Navigation IconData integrity

LO Navigation IconSchlüsselintegrität

LO Navigation IconGegenstandsintegrität

LO Navigation IconReferentielle Integrität

LO Navigation IconIntegritätsgefährdung

Unit Navigation IconNormalisierung

Unit Navigation IconSummary

Unit Navigation IconRecommended Reading

Unit Navigation IconGlossary

Unit Navigation IconBibliography

Unit Navigation IconMetadata


GITTA/CartouCHe news:


Go to previous page Go to next page

Key integrity

Relations are defined as a unique set of tuples where no two tuples have the same combination of values for all their attributes. To be distinct, they must have some primary key that allows to reference each tuple. Key constraints deal with this issue.

Candidate key:
Each attribute or minimal combination of attributes that uniquely identifies any tuple in a relation is called a candidate key. Minimal means that removing an attribute leaves the key without the ability to uniquely identify any tuple and therefore not being a candidate key anymore.
Primary key:
The primary key is one chosen key candidate that acts as the identification key for a relation. Usually this is a short attribute like a ID-number (identification key) or username. Attributes of the primary are commonly underlined.
Top Go to previous page Go to next page