论文信息 - Logical design of relational database schemes

Logical design of relational database schemes

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

Z. Meral Özsoyoglu | Li-Yan Yuan

[1] Catriel Beeri,et al. On the Desirability of Acyclic Database Schemes , 1983, JACM.

[2] Ronald Fagin,et al. Multivalued dependencies and a new normal form for relational databases , 1977, TODS.

[3] Philip A. Bernstein,et al. Computational problems related to the design of normal form relational schemas , 1979, TODS.

[4] Hirofumi Katsuno. An extension of conflict-free multivalued dependency sets , 1984, TODS.

[5] Catriel Beeri,et al. An integrated approach to logical design of relational database schemes , 1986, TODS.

[6] Z. Meral Özsoyoglu,et al. A normal form for nested relations , 1985, PODS.

[7] Z. Meral Özsoyoglu,et al. Unifying functional and multivalued dependencies for relational database design , 1985, PODS '86.

[8] Jeffrey D. Ullman,et al. Principles of Database Systems , 1980 .

[9] Y. Edmund Lien,et al. On the Equivalence of Database Models , 1982, JACM.

[10] Zvi Galil,et al. An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database , 1982, JACM.

[11] Y. Edmund Lien,et al. Hierarchical schemata for relational databases , 1981, TODS.

[12] Gösta Grahne,et al. Database Decomposition into Fourth Normal Form , 1983, VLDB.