|
|
|
@inproceedings{DBLP:conf/pods/YuanO86,
author = {Li-Yan Yuan and
Z. Meral {\"O}zsoyoglu},
editor = {Avi Silberschatz},
title = {Unifying Functional and Multivalued Dependencies for Relational
Database Design},
booktitle = {Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles
of Database Systems, March 24-26, 1986, Cambridge, Massachusetts,
USA},
publisher = {ACM},
year = {1986},
isbn = {0-89791-179-2},
pages = {183-190},
ee = {http://doi.acm.org/10.1145/6012.15414, db/conf/pods/YuanO86.html},
crossref = {DBLP:conf/pods/86},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
We consider the problem of unifying functional dependencies (FDs) and multivalued dependencies (MVDs) in designing relational database schemes. Given a set D of dependencies (MVDs and FDs) over a universal scheme U, we define a different set of MVDs over U, called the envelope set for D, so that a database scheme with respect to D can be designed by considering only the MVDs in the envelope set for D, instead of treating MVDs and FDs in D separately. We show that a database scheme is in 4NF with respect to D (BCNF if D consists of only FDs) if it is 4NF with respect to the envelope set for D.
By utilizing the envelope set of dependencies we extend the conflict free property of sets of MVDs to apply to sets of FDs and MVDs. We show that if a set D of dependencies is extended conflict free then there exists an acyclic, join lossless 4NF decomposition (BCNF) with respect to D which is also dependency preserving. Except for the case where D is a set of MVDs only, this was an open problem in the literature. We also show that for a set M of MVDs, an acyclic join lossless 4NF decomposition exists if M does not split its keys.
Given a set of dependencies D, obtaining the envelope set for D, determining whether D is extended conflict free, and if D is extended conflict free then obtaining a dependency preserving, acyclic, join lossless, 4NF decomposition can be done in time polynomial in the size of D.
Copyright © 1986 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.
Data released under the ODC-BY 1.0 license — See also our legal information page