Synonyms
Uniqueness constraint
Definition
In the relational model, a key for a relational schema is a set of attributes whose value(s) uniquely identify a tuple in a valid instance of the relation. Said another way, key value(s) appear at most once in a relation. Often the set of attributes constituting a key is a set with a single attribute. For example, in the relation
the singleton set consisting of just CustomerID is a key and so is the set consisting of the pair of attributes (Name, Address). The values of CustomerID (here, 11111 and 22222) each uniquely identify a tuple. In any valid instance for this relation, no CustomerID value may appear twice. Similarly, the pair (Name, Address) is a key. Pairs of (Name, Address)...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Embley, D.W. (2018). Key. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_811
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_811
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering