Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
Yehoshua Sagiv, Scott F. Walecka · Journal of the ACM · 1982
It tS shown that embedded multwalued dependencies do not have a complete axlomatizatlon A new type of dependenoes, called subset dependencies, is introduced.Subset dependencies are a generahzauon of embedded multtvalued dependencies It is shown that a subclass of subset dependenoes (that does not include all the embedded multwalued dependenoes) has a complete axlomatlzation consisting of reflexivity and translt~vity rules As a result, ~t ~s shown how to test implications of embedded muluvalued dependencies under some restricted conditions Categories and Subject Descriptors H 2 1 ]Database Management] Logical Destgn--data models