Copyright © 1998 Published by Elsevier Science Ltd.
Technical note
Minimal lossless decompositions and some normal forms between 4NF and PJ/NF*1
Received 3 August 1997;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Two popular textbooks in relational database theory are shown to have the same ‘erroneous’ definition of the project-join normal form (PJ/NF) (‘erroneous’ in the sense that their definition is obviously not what the authors intend). A seemingly natural way to rephrase this definition is to introduce the concept minimal lossless decompositions. This concept is shown to yield a countable family of normal forms lying strictly between 4NF and Fagin's original PJ/NF. It also gives an upper bound on the complexity of join dependencies.
Author Keywords: Normalisation; Lossless Decomposition; Normal Form






E-mail Article
Add to my Quick Links

Cited By in Scopus (0)




