Super keys, Database Management System

Assignment Help:

A super key is an attribute or set of attributes used to recognize the records uniquely in a relation.

For instance, in the Relation PERSON defines earlier PERSON_ID is a super key since PERSON_ID is unique for every person. Likewise (PERSON_ID, AGE) and (PERSON_ID, NAME) are also super keys of the relation PERSON as their combination is also unique for each record.


Related Discussions:- Super keys

What is foreign key, What is foreign key? Foreign Key - Let there are...

What is foreign key? Foreign Key - Let there are two relations in tables R and S. Any candidate key of the relation R that is referred in the relation S is known as the forei

Describe in brief about object oriented design, Describe about Object orien...

Describe about Object oriented design Object oriented design is concerned with developing an object oriented model of a software system to implement known requirements. Many OO

Which operations need the participating relations to union, Which operation...

Which operations need the participating relations to be union compatible? A UNION, INTERSECTION and DIFFERENCE operations need the participating relations to be union compatibl

Data fragmentation, Data Fragmentation "Fragmentation includes decompos...

Data Fragmentation "Fragmentation includes decomposing the data in relation to non-overlapping component relations". Why do we require fragmenting a relation?

What is candidate key, What is Candidate Key Super Key or Candidate Ke...

What is Candidate Key Super Key or Candidate Key: It is such an attribute of a table that can uniquely recognize a row in a table. Generally they have unique values and can n

What is transaction, What is transaction? Transaction is a unit of prog...

What is transaction? Transaction is a unit of program implementation that accesses and possibly updated several data items.

Which sorting technique is used to sort databases, Which sorting technique ...

Which sorting technique is used to sort databases, whose sizes are very big?  Give one such algorithm.  Why do sorting techniques like quicksort, insertion sort, etc.  not applied

Define average seek time, Define average seek time. The average seek ti...

Define average seek time. The average seek time is the average of the seek times, calculated over a sequence of random requests.

What is bcnf boyce-codd normal form, BCNF Boyce-Codd Normal Form A rel...

BCNF Boyce-Codd Normal Form A relation schema R is in BCNF if it is in 3NF and accepts an additional constraint that for every FD X A, X has to be a candidate key. If a relati

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