Register

functional dependency
closed

• closed by
476 views
0 votes
0 votes
closed with the note: bad question

R(ABC)  
Find out all functional dependencies by these two

A----->B ,  

B------>C

ACCORDING TO KORTH ,Since a set of size n has 2n subsets, there are a total of 2 × 2n = 2n+1 possible functional dependencies, where n is the number of attributes in R

someone explain this pls 

• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
1 answer
1
anabee asked Jan 15, 2018
1,735 views
3NF Fully functional dependent
Consider the following statements: A relation R is in 3NF, if every non-prime attribute of R, is fully functionally dependent on some key of R. State True or False
Consider the following statements:A relation R is in 3NF, if every non-prime attribute of R, is fully functionally dependent on some key of R.State True or False
User Avatar
0 votes
0 votes
1 answer
2
vivek1211 asked Mar 12, 2023
668 views
functional dependency
given an instance of relation R(ABC). find all non-trivial FDsare AB->C, AC->B, BC→ A true ??
given an instance of relation R(ABC). find all non-trivial FDsare AB->C, AC->B, BC→ A true ??
User Avatar
6 votes
6 votes
5 answers
4
srestha asked Apr 28, 2019
1,495 views
Made Easy Test Series:DBMS-Functional Dependency
Consider a relation $R\left ( A,B,C,D,E \right )$ and functional dependencies are $F=\left \{ AC\rightarrow B,C\rightarrow D,A\rightarrow E,C\rightarrow B \right \}$ Relation $R$ ... Then Is it a lossless decomposition? I am getting doubt, how it can be not lossless decomposition?
Consider a relation $R\left ( A,B,C,D,E \right )$ and functional dependencies are $F=\left \{ AC\rightarrow B,C\rightarrow D,A\rightarrow E,C\rightarrow B \right \}$Relat...
User Avatar
Link Copied!