#### Filter Results:

#### Publication Year

1975

1982

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The candidate keys, as defined by E. F. Codd [4], are important in the process of reducing a normalized relation into second and third normal forms.Given a set of functional relations, Delobel and Casey [6] transformed this set into a Boolean function and it was shown that the set of all prime implicants of this function that have no primed variables are… (More)

There are two basic approaches in the normalization theory of relational databases. One approach is the decomposition of large relation schemes into smaller relation schemes. A required criteria for a satisfactory decomposition is the lossless join property. The other approach is to synthesize a set of relation schemes from a given set of functional… (More)

- ‹
- 1
- ›