0% found this document useful (0 votes)
3 views3 pages

Stack

The document explains key concepts in relational database structures, including Primary Keys, Candidate Keys, Alternate Keys, and Foreign Keys. It emphasizes the importance of referential integrity in maintaining valid relationships between records in related tables. The document uses an election analogy to illustrate how these keys function within a database.

Uploaded by

Kajal Gautam
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
3 views3 pages

Stack

The document explains key concepts in relational database structures, including Primary Keys, Candidate Keys, Alternate Keys, and Foreign Keys. It emphasizes the importance of referential integrity in maintaining valid relationships between records in related tables. The document uses an election analogy to illustrate how these keys function within a database.

Uploaded by

Kajal Gautam
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
11>) ies 24/06/2025 08:30 dont No! o1- 22-04-73. Cadially Restor 24/06/2025 _aiaatsa Saca Amat #189860 [7 Rashea | Rana #192134 [arFanad | Rania | : ee oe ee Oe Degree Relational Data Structure KEYS IN A DATABASE ing, Relation is known as Primary Key. i iquely i 2 CANDIDATE KEY ~ An Attribute or a set of Attributes that has the ability to uniquely identify ag tuple in the Relation is known as a Candidate Key. i 3. ALTERNATE KEY ~ All the Candidate Keys which were not chosen to be Primary Key arg 4 known as Alternate Keys, FOREIGN KEY - An Attribute or a Set of Attributes in one relation which refer to the Primary ig of any other Relation is known as the Foreign Key of the Relation. They are used to estab, relationships between Tables. REFERENTIAL INTEGRITY: A referential integrity is a system of rules that a DBMS uses to nsw, that relationships between records in related tables are valid, and that users don't accidentally dja or change related data. This integrity is ensured by foreign key. Tips to Remember regarding Keys in a Database One can always relate the Keys in a Relation to be like the Representatives of Each Political Party during an Election. + Allrepresentatives are those who promise to uniquely identify the problems of each vote: in the country. They are the Candidates for the Election. In a similar way, Candidate Keys can uniquely identify each tuple. After the Elections One Candidate among all the Candidates are elected as the Prime Minister of the Country. Similarly, any one of the Candidate Keys which has been chosen by the Database Developer to uniquely identify each tuple is the Primary Key of the Relation. All those Candidates who could not become the Prime Minister, become the the Opposition. Similarly, all the Candidate Keys which were not chosen to be oa are also known as Alternate Keys of the Relation, 3 The Prime Minister of the Country often sends Fo) Minster in other countries, Similarly, refers to the Primary Key of some other reign Ministers to represent the P! a Foreign Key are attributes in a relation Relation. REDMI 13C 24/06/2025 08:30

You might also like