Candidate Key
Candidate Key is a minimal superkey within the relational model of databases, distinguished by its unique identification of tuples without redundant attributes.
17
Publications
527
Citations
32
Authors
19
Institutions
Publications per year
2017–2026
1
Variants
Candidate Keys
Parents
17
Cláudio L. Lucchesi, Sylvia L. Osborn · Journal of Computer and System Sciences · 1978 · 154 citations
On the equivalence of candidate keys with Sperner systems.
János Demetrovics · Acta Cybernetica · 1979 · 64 citations · Full text
1–5 of 17
32
3
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 32
19
Hasso Plattner Institute
Potsdam, Germany
2 h-index
3 publications
76 citations

Manchester Metropolitan University
Manchester, United Kingdom
1 h-index
1 publications
34 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
1 publications
34 citations
University of Nebraska at Omaha
Omaha, United States
1 h-index
1 publications
30 citations
Jouf University
Sakakah, Saudi Arabia
1 h-index
1 publications
25 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
1 h-index
1 publications
10 citations
HUN-REN Institute for Computer Science and Control
Budapest, Hungary
1 h-index
1 publications
20 citations

Commonwealth Scientific and Industrial Research Organisation
Canberra, Australia
1 h-index
1 publications
15 citations
1–8 of 19
2 publications · 42 citations
2
h-index
Repository · 1 publications · 15 citations
1
h-index
DKE · 1 publications · 34 citations
1
h-index
Repository · 1 publications · 14 citations
1
h-index
PVLDB · 1 publications · 10 citations
1
h-index
1–5