found this : http://www.dbforums.com/da
interestingly, dportas is an EE expert as well...
Main Topics
Browse All TopicsI've got the next question, (i've answered it on a uni test) and im not sure wether this is true or not what i have explained:
Given the relational scheme R= {A,B,C,D,E} on a relation r(R)
Is {A,B,C,D,E} a superkey?
I would assume it CAN be, but it also can not be a superkey in the case that some registers may have all the same content in the fields, so it wouldn't be a superkey as such in that case.
What do you think?
This Question has been solved and asker verified All Experts Exchange premium technology solutions are available to subscription members.
Experts Exchange has been collecting answers to technology questions since 1996…3 million and counting! If you have a question, chances are we already have your answer.
If you can't find the exact answer you're looking for, ask our exclusive community of 50,000 experts. You’ll get a personalized answer from a trusted professional.
Thousands of free tech tips, tricks, how-to’s and tutorials are available in our peer reviewed articles section. See for yourself how smart our experts are, no login required.
Access the answers to your technology questions today.
30-day free trial. Register in 60 seconds.
Members of the expert community talk about why the experience at Experts Exchange is different than what you will find anywhere else.

Try it out and discover for yourself.
30-day free trial. Register in 60 seconds.
Join the community of experts here and help other tech pros by answering question in your area of expertise. You can earn FREE access to all Experts Exchange's premium features and resources.
found this : http://www.dbforums.com/da
interestingly, dportas is an EE expert as well...
According to this definition, if we have two tuples with the same info in all the fields, it wouldn't be a superkey:
A superkey is any set of attributes (K) such that no two tuples of a relation can have the same values for K, i.e: t1(K) != t2(K) for every possible pair of distinct tuples.
It looks like is not clear when we think of the case when all the attributes have the same value. So does this mean that it CAN be a superkey only in the case that no pair of distinct tuples has the same values in all the fields?
>> It looks like is not clear when we think of the case when all the attributes have the same value.
That's not possible though because a relation is always a set of distinct tuples. That's the definition of a relation. So for every relation the heading of that relation (all the attributes) is always a superkey.
Business Accounts
Answer for Membership
by: mark_willsPosted on 2009-06-17 at 05:52:41ID: 24647589
A superkey is a combination of attributes that can be uniquely used to identify a database record. So, given the information to date, then Yes.
Is that the full question ? They normally through in a matrix of possible values...
A definition : A superkey is a combination of attributes that can be uniquely used to identify a database record. A table might have many superkeys. Candidate keys are a special subset of superkeys that do not have any extraneous information in them