Logical design of relational database schemes

  • Authors:

  • L. Y. Yuan;Z. M. Ozsoyoglu

  • Affiliations:

  • The Center for Advanced Computer Studies, The University of Southwestern Louisiana, Lafayette, LA;Computer Engmeermg and Science Department, Case Western Reserve University, Cleveland, Ohio

  • Venue:
  • PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

We define extended conflict free dependencies in the context of functional and multivalued dependencies, and prove that there exists an acyclic, dependency preserving, 4NF database scheme if and only if the given set of dependencies has an extended conflict free cover. This condition can be checked in polynomial time. A polynomial time algorithm to obtain such a scheme for a given extended conflict free set of dependencies is also presented. The result is also applicable when the data dependencies consists of only functional dependencies, giving the necessary and sufficient condition for an acyclic, dependency preserving BCNF database scheme