Efficient algorithm to compute the candidate keys of a relational database schema

Computer Journal

Volumn 39, Issue 2, 1996, Pages 124-132

  Saiedian, H ^a   Spencer, Th ^a  

^a UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; EFFICIENCY; FUNCTIONAL ASSESSMENT; GRAPH THEORY; SET THEORY;

CANDIDATE KEYS;

RELATIONAL DATABASE SYSTEMS;

EID: 0029710777     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/39.2.124     Document Type: Article

References (9)