Finding Candidate Keys For Relational Data Bases
Summary: New dependency-based method to enumerate all candidate keys of a normalized relation, avoiding Boolean functions. Uses an implication matrix with its transitive closure and a systematic attribute-adding procedure; suitable for hand calculation and computer implementation, offering an alternative to prime-implicant approaches. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Raymond Fadous (Michigan State University)
- 2. John Forsyth (Michigan State University)
BibTeX Citation
@inproceedings{fadous_sigmod75,
title = {{FINDING CANDIDATE KEYS FOR RELATIONAL DATA BASES}},
author = {Fadous, Raymond and Forsyth, John},
series = {{SIGMOD} '75},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/500080.500109},
url = {https://dl.acm.org/doi/10.1145/500080.500109},
year = {1975}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,119 | Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery | 2020 | VLDB | 5.46934e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 590 | On The Semantics Of The Relational Data Model | 1975 | SIGMOD |
| 2 | 7,571 | Operations and the Properties on Non-First-Normal-Form Relational Databases | 1983 | VLDB |
| 3 | 3,425 | Reflections on Boyce-Codd Normal Form | 1982 | VLDB |
| 4 | 10,926 | Efficient Discovery of Relaxed Functional Dependencies | 2025 | VLDB |
| 5 | 616 | Reasoning about Record Matching Rules | 2009 | VLDB |
| 6 | 9,926 | On Concise Set of Relative Candidate Keys | 2014 | VLDB |
| 7 | 5,272 | Computing Covers for Embedded Functional Dependencies | 1987 | PODS |
| 8 | 6,827 | Practical algorithms for finding prime attributes and testing normal forms | 1989 | PODS |
| 9 | 4,247 | A Unified Approach to Functional Dependencies and Relations | 1975 | SIGMOD |
| 10 | 6,674 | An Improved Algorithm for Finding a Key of a Relation | 1985 | PODS |