1. Candidate keyIn the relational model of databases, a candidate key of a relation is a minimal superkey for that relation; that is, a set of attributes such that the relation does not have two distinct tuples (i.e. rows or records in common database language) with the same values for these attributes (which means that the set of attributes is a superkey) there is no proper subset of these attributes for which (1) holds (which means that the set is minimal).
Read “Candidate key” on English Wikipedia
Read “候補キー” on Japanese Wikipedia
Read “Candidate key” on DBpedia
Read “Candidate key” on English Wikipedia
Read “候補キー” on Japanese Wikipedia
Read “Candidate key” on DBpedia
Discussions
Log in to talk about this word.