Synthesizing third normal form relations from functional dependencies

Bernstein, Philip A.

doi:10.1145/320493.320489

Cited by 377 publications

(168 citation statements)

References 5 publications

Supporting

Mentioning

166

Contrasting

Unclassified

Order By: Relevance

“…The elimination of non-implied extraneous attribute is postponed until the time that redundant dependencies are eliminated, using the Algorithm A3. Many algorithms, sometimes difficult to reuse, have been proposed in [11], [12] for removing extraneous attributes.…”

Section: Definitionmentioning

confidence: 99%

Algorithm for Relational Database Normalization Up to 3NF

Demba¹

2013

IJDMS

View full text Add to dashboard Cite

show abstract

Section: Definitionmentioning

confidence: 99%

Algorithm for Relational Database Normalization Up to 3NF

Demba¹

2013

IJDMS

View full text Add to dashboard Cite

show abstract

“…(i) a 3-(n, 2) EK design for n ∈ {4, 6}, (ii) a 2-(n, 2) EK design for n ∈ {9, 17, 25}, and a 2-(n, 3) EK design for n ∈ {19, 28, 37, 46, 55, 73, 82, 91, 109, 118, 127, 145, 163, 181, 199}, (iii) a (2 u , 2) EKGDD for u ∈ {4, 5,6,7,8,9,10,11,12,14,15,18,19, 23}, a (1 u t, 2) EKGDD for (u, t) ∈ {(8, 3), (16,3), (16,7), (24, 3), (24, 5), (24, 7)}, an (8 u t, 2) EKGDD for u ∈ {6, 7}, t ∈ {4, 6}, a (3 u , 3) EKGDD for u ∈ {7, 8, 9, 10, 11}, and an (18 u 27, 3) EKGDD for u ∈ {7, 8}, (iv) a 2-(4, 2) EK packing of size one, and a 2-(n, 2) EK packing of size n(n − 1)/8 − 1 for n ∈ {5, 6, 7, 13, 15, 21}.…”

Section: Direct Constructionsmentioning

confidence: 99%

Optimal codes in the Enomoto-Katona space

Chee

Kiah

Zhang

et al. 2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Coding in a new metric space, called the Enomoto-Katona space, has recently been considered in connection with the study of implication structures of functional dependencies and their generalizations in relational databases. The central problem is the determination of C (n, k, d), the size of an optimal code of length n, weight k, and distance d in the Enomoto-Katona space. The value of C(n, k, d) was known only for some congruence classes of n when (k, d) ∈ {(2, 3), (3, 5)}. In this paper, we obtain new infinite families of optimal codes in the Enomoto-Katona space and verify a conjecture of Brightwell and Katona in certain instances. In particular, C(n, k, 2k − 1) is determined for all sufficiently large n satisfying either n ≡ 1 mod k and n(n − 1) ≡ 0 mod 2k 2 , or n ≡ 0 mod k. We also give complete solutions for k = 2 and determine C(n, 3, 5) for certain congruence classes of n with finite exceptions.

show abstract

“…An algorithm to synthesize 3NF relations by combining individual functional dependencies of an un-normalized relation is provided by Bernstein (1976). A different decomposition algorithm to break down an un-normalized relation to BCNF relations is provided in several textbooks (Elmasri & Navathe, 2007, p. 388;Kifer et al, 2006, p. 219;Ullman and Widom, 2008, p.92).…”

Section: Verifying and Achieving Goodness Of Designmentioning

confidence: 99%

Teaching Database Modeling and Design: Areas of Confusion and Helpful Hints

Philip

2007

JITE:Research

View full text Add to dashboard Cite

Executive SummaryThis paper identifies several areas of database modeling and design that have been problematic for students and even are likely to confuse faculty. Major contributing factors are the lack of clarity and inaccuracies that persist in the presentation of some basic database concepts in textbooks. The paper analyzes the problems and discusses ways to minimize them. Specifically, the paper discusses the practical role of normalization in database design, addresses the confusion in representing attributes with repeating values, discusses how to remove inconsistencies in defining relations and first normal form, simplifies the process of identifying candidate keys to normalize relations, clarifies the conditions under which insertion and deletion anomalies may occur, and sheds light on the confusion in defining weak entities.Normalization plays a vital role in both the theory and the practice of database design. The topdown approach popularly used in relational database design creates a conceptual schema that is represented by entity-relationship (E-R) models, and then uses mapping rules to convert the conceptual schema to relation schemas. Because E-R modeling is an intuitive process, errors could occur in identifying entities and their relationships, resulting in un-normalized relations. Unnormalized relations also could result from converting files in legacy systems and spreadsheets to relational tables. Normalization plays a key role in verifying the goodness of design of such relations and in improving the design.The concept of repeating values in relations plays a major role in defining relations and first normal form. Yet, textbooks in general do not distinguish between multi-valued and single-valued attributes in a schema. This lack of clarity may result in conflicting interpretations of the schema. The paper presents a simple solution to the problem.The lack of clarity in defining the terms tables, relations, and first normal form (1NF) in textbooks is another potential source of confusion. Some books define relation as a A challenging task for many students during the normalization process is checking whether a determinant is a Material published as part of this publication, either on-line or in print, is copyrighted by the Informing Science Institute. Permission to make digital or paper copy of part or all of these works for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage AND that copies 1) bear this notice in full and 2) give the full citation on the first page. It is permissible to abstract these works so long as credit is given. To copy in all other cases or to republish or to post on a server or to redistribute to lists requires specific permission and payment of a fee. Contact Publisher@InformingScience.org to request redistribution permission.Teaching Database Modeling and Design 482 candidate key. The standard method is to check whether every attribute of the relation is functionally dependent on ...

show abstract

Synthesizing third normal form relations from functional dependencies

Cited by 377 publications

References 5 publications

Algorithm for Relational Database Normalization Up to 3NF

Algorithm for Relational Database Normalization Up to 3NF

Optimal codes in the Enomoto-Katona space

Teaching Database Modeling and Design: Areas of Confusion and Helpful Hints

Contact Info

Product

Resources

About