An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema (Q4886686)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema |
scientific article; zbMATH DE number 907011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema |
scientific article; zbMATH DE number 907011 |
Statements
An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema (English)
0 references
11 December 1996
0 references
functional dependencies
0 references
relational database
0 references
