Theory of Multivalued Dependencies Let D denote a set of functional and multivalued dependencies.The closure D+of D is the set of all functional and multivalued dependencies logically implied by D. Sound and complete inference rules for functional and multivalued dependencies: 1.Reflexivity rule.If a is a set of attributes and B ca,then a->B holds. 2.Augmentation rule.If a->B holds and y is a set of attributes, then y→yβholds. 3.Transitivity rule.lfa→B holds and B→y holds,then a→yholds. Database System Concepts-7th Edition 28.15 ©Silberscha乜，Korth and SudarshanDatabase System Concepts - 7 28.15 ©Silberschatz, Korth and Sudarshan th Edition Theory of Multivalued Dependencies ▪ Let D denote a set of functional and multivalued dependencies. The closure D+ of D is the set of all functional and multivalued dependencies logically implied by D. ▪ Sound and complete inference rules for functional and multivalued dependencies: 1. Reflexivity rule. If  is a set of attributes and   , then  → holds. 2. Augmentation rule. If  →  holds and  is a set of attributes, then  →  holds. 3. Transitivity rule. If  →  holds and  → holds, then  → holds