McqMate

Q. |
## We can use the following three rules to find logically implied functional dependencies. This collection of rules is called |

A. | Axioms |

B. | Armstrong’s axioms |

C. | Armstrong |

D. | Closure |

Answer» B. Armstrong’s axioms |

752

0

Do you find this helpful?

1

View all MCQs in

DataBase Management System (DBMS)No comments yet

- Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is
- How many inference rules are there for functional dependencies?
- There are two functional dependencies with the same set of attributes on the left side of the arrow: A->BC A->B This can be combined as
- Consider a relation R(A,B,C,D,E) with the following functional dependencies: ABC -> DE and D -> AB The number of superkeys of R is:
- Given the functional dependencies X →W; X→Y; Y→Z and Z→PQ Which of the following doesn’t hold well?
- Functional dependencies are a generalization of
- Functional Dependencies are the types of constraints that are based on
- Relation dept year(dept name, total inst 2007, total inst 2008, total inst 2009). Here the only functional dependencies are from dept name to the other attributes. This relation is in
- Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is
- Relation dept year(dept name, total inst 2007, total inst 2008, total inst 2009). Here the only functional dependencies are from dept name to the other attributes. This relation is in