Computational problems related to the design of normal form relational schemas

  title={Computational problems related to the design of normal form relational schemas},
  author={Philip A. Bernstein},
  journal={ACM Trans. Database Syst.},
  • P. Bernstein
  • Published 1 March 1979
  • Computer Science
  • ACM Trans. Database Syst.
Problems related to functional dependencies and the algorithmic design of relational schemas are examined. Specifically, the following results are presented: (1) a tree model of derivations of functional dependencies from other functional dependencies; (2) a linear-time algorithm to test if a functional dependency is in the closure of a set of functional dependencies; (3) a quadratic-time implementation of Bernstein's third normal form schema synthesis algorithm. Furthermore, it is shown that… 

Figures from this paper

Computing covers for embedded functional dependencies
This paper shows how this problem of computing covers for the functional dependencies embedded in a subset of a given relation schema can be simplified and presents a new and efficient algorithm “Reduction by Resolution” (RBR) for its solution.
Graph Algorithms for Functional Dependency Manipulation
A graph-theoretic approach for the representation of functional dependenoes in relauonal databases is introduced and applied in the construction of algorithms for manipulating dependencies, which leads to simpler proofs and, in some cases, more efficient algorithms than in the current literature.
Horn clauses and functional dependencies in complex-value databases
It is shown that this equivalence still holds for functional dependencies in databases that support complex values via nesting of records, lists, sets and multisets and that relational database design tools can be reused to solve problems for complex-value databases.
Domination Normal Form - Decomposing Relational Database Schemas
This paper proposes and analyzes a new normal form based on the idea of minimizing overall storage space, in contrast to existing normal forms such as BCNF, 4NF or KCNF, which only characterize the absence of redundancy for a single schema.
An improved third normal form for relational databases
An improved third normal form is defined and an algorithm is given to construct a set of relations from a given set of functional dependencies in such a way that the superfluous attributes are guaranteed to be removed.
A Parallel Algorithm for Relational Database Normalization
  • E. Omiecinski
  • Computer Science
    IEEE Trans. Parallel Distributed Syst.
  • 1990
It is shown that a reduced cover for a set of functional dependencies can be produced in parallel and it is demonstrated that the companion third normal form algorithm can be easily translated into a parallel version.
A new normal form for the design of relational database schemata
It is proved that Bernstein's algorithm for schema design synthesizes schemata that are already in the new normal form, which is stricter than 3NF, but it is still compatible with the representation principle.


Synthesizing third normal form relations from functional dependencies
An effective procedure for performing a relational scheme synthesis is presented and the schema that results from this procedure is proved to be in Codd's third normal form and to contain the fewest possible number of relations.
The Decomposition Versus Synthetic Approach to Relational Database Design
This work demonstrates the fourth normal form approach, which not only can deal with this difficulty, but which is also more powerful than either of the earlier approaches.
Dependency Structures of Data Base Relationships
The results of the present paper are applied to derive new and simpler proofs of some theorems of Casey and Delobel [5] and some conclusions are given.
A complete axiomatization for functional and multivalued dependencies in database relations
The main result of the paper is that the rules presented are complete for the family of functional and multivalued dependencies.
Segment Synthesis in Logical Data Base Design
This paper presents an approach to synthesizing logical segments that are representations of entities and relationships relevant to an application according to prescribed performance requirements and projected information maintenance activities.
Functional Dependencies in a Relational Data Base and Propositional Logic
An equivalence is shown between functional dependency statements of a relational database and implicational statements of propositional logic, where it is shown that a dependency statement is a consequence of a set of dependency statements if the correspondingimplicational statement isA consequence of the corresponding set of implICational statements.
Independent components of relations
The main result states that the operator which reconstructs the original relation from its independent components is the natural join, and that independent components split the full family of functional dependencies into corresponding component families to give an easy-to-check criterion for independence.
Comment on "Segment Synthesis in Logical Data Base Design"
The examples shown in Figs. 2 and 3 of [ 13 illustrate the existence of simple cycles in the data model between the department and the manager of each case. Such relations, which are cyclic on a
Formal languages and their relation to automata
  • J. HopcroftJ. Ullman
  • Computer Science
    Addison-Wesley series in computer science and information processing
  • 1969
The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory.
The Design and Analysis of Computer Algorithms
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.