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)

Paper ID: 2022
Venue: SIGMOD
Year: 1975
Pagerank: 4.5109131e-05
Overall Rank: 8,445 | 41.26%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Raymond Fadous
2. John Forsyth

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,850	Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery	2020	VLDB	4.4364648e-05

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

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
120	On The Semantics Of The Relational Data Model	1975	SIGMOD	0.00045646715
6,938	Operations and the Properties on Non-First-Normal-Form Relational Databases	1983	VLDB	4.8925595e-05
3,111	Reflections on Boyce-Codd Normal Form	1982	VLDB	7.5474137e-05
10,587	Efficient Discovery of Relaxed Functional Dependencies	2025	VLDB	4.1945683e-05
702	Reasoning about Record Matching Rules	2009	VLDB	0.00017918203
9,725	On Concise Set of Relative Candidate Keys	2014	VLDB	4.2945121e-05
4,463	Computing Covers for Embedded Functional Dependencies	1987	PODS	6.160725e-05
5,781	Practical algorithms for finding prime attributes and testing normal forms	1989	PODS	5.3298267e-05
1,813	A Unified Approach to Functional Dependencies and Relations	1975	SIGMOD	0.00010464576
5,408	An Improved Algorithm for Finding a Key of a Relation	1985	PODS	5.5240911e-05