An efficient algorithm for 3NF determination (Q558039): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Graph Algorithms for Functional Dependency Manipulation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3780508 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of recognizing 3NF relation schemes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Candidate keys for relations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema / rank | |||
Normal rank | |||
Latest revision as of 13:11, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for 3NF determination |
scientific article |
Statements
An efficient algorithm for 3NF determination (English)
0 references
30 June 2005
0 references
Relation
0 references
Candidate key
0 references
Superkey
0 references
Functional dependency
0 references
Third normal form
0 references
Prime attribute
0 references
Closure
0 references
