Which normal form is found adequate in most relational opera
Which normal form is found adequate in most relational operations ?
A3 NF
B4 NF
C5 NF
D2 NF
Which normal form is found adequate in most relational operations ?
Akilesh Kharvi ? Dec 8 '2016 at 19:39
Answer: 3 NF
Explanation:
A relational database table is often described as “normalized” if it is in the Third Normal Form because most of the 3NF tables are free of insertion, update, and deletion anomalies. so answer is deadlock avoidance
Nithin K ? Dec 7 '2016 at 22:3
Answer: 100
Explanation:
From the given set of functional dependencies, it can be observed that B is a candidate key of R.
So all 200 values of B must be unique in R. There is no functional dependency given for S. To get the maximum number of tuples in output, there can be two possibilities for S.
1) All 100 values of B in S are same and there is an entry in R that matches with this value. In this case, we get 100 tuples in output.
2) All 100 values of B in S are different and these values are present in R also. In this case also, we get 100 tuples.
Assume the following relational schema :
Suppliers ( sid ; sname ; city ; street )
Parts ( pid ; pname ; pcolor )
Catalog ( sid ; pid ; cost).
Assume each supplier and each street within the city is unique and ( sname, city ) forms a candidate key. No other functional dependencies, except those implied in the schema exist. Which of the following statements is true ?