Let r be a relation of degree n what is the maximum number


Question: 1. Let R be a relation of degree n. What is the maximum number of functional dependencies R can possibly satisfy (trivial as well as nontrivial)?

2 What does it mean to say that Armstrong's rules of inference are sound? Complete?

3 Prove the reflexivity, augmanation, and transitivity rules, assuming only the basic defini-tion of functional dependence.

4 Prove that the three rules of the previous exercise imply the self-determination, decompo-sition, union, and composition rules.

Request for Solution File

Ask an Expert for Answer!!
Database Management System: Let r be a relation of degree n what is the maximum number
Reference No:- TGS02324275

Expected delivery within 24 Hours