Some results about the third normal form for relation scheme
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/15/1/7754Abstract
The third normal form (3NF) which was introduced by E. F. Codd is an important normal form for relation schemes in the relational database. It is known [6] that a set of minimal keys of a relation scheme is a Sperner system (some times it is called an antichain) and for an arbitrary Sperner system there exists a relation scheme the set of minimal keys of which is exactly this Sperner system, This paper gives new necessary and sufficient conditions for an arbitrary relation scheme is in 3NF and its set of minimal keys is a given Sperner system.
Metrics
Downloads
Published
How to Cite
Issue
Section
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.