Candidate key (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Candidate key" in English language version.

Last modified: 03:54:41, 25 May 2025 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2^nd place

4,192^nd place

2,461^st place

9,249^th place

6,951^st place

292^nd place

233^rd place

4^th place

doi.org (Global: 2^nd place; English: 2^nd place)

Saiedian, H. (1996-02-01). "An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema". The Computer Journal. 39 (2): 124–132. doi:10.1093/comjnl/39.2.124. ISSN 0010-4620.
L. Lucchesi, Cláudio; Osborn, Sylvia L. (October 1978). "Candidate keys for relations". Journal of Computer and System Sciences. 17 (2): 270–279. doi:10.1016/0022-0000(78)90009-0.

Date, Christopher (2015). "Codd's First Relational Papers: A Critical Analysis" (PDF). warwick.ac.uk. Retrieved 2020-01-04. Note that the extract allows a "relation" to have any number of primary keys, and moreover that such keys are allowed to be "redundant" (better: reducible). In other words, what the paper calls a primary key is what later (and better) became known as a superkey, and what the paper calls a nonredundant (better: irreducible) primary key is what later became known as a candidate key or (better) just a key.