Q. State true or false: Redundancy is desired in a relational schema

View solution

Q. An instance of a relation that satisfies all real world constraints is known as?

View solution

Q. If K → R then K is said to be the _______ of R

View solution

Q. X → Y holds on a schema k(K) if?

View solution

Q. X→ Y is trivial if?

View solution

Q. Which of the following is not a condition for X→ Y in Boyce codd normal form?

View solution

Q. Which of the following is used to express database consistency?

View solution

Q. Which of the following is not a condition for the third normal form in the case of X→Y?

View solution

Q. F+ is called as the ________ of F

View solution

Q. State true or false: A functional dependency must first satisfy the second normal form to satisfy the third normal form.

View solution

Q. State true or false: The fourth normal form does not exist and it is instead called as the BCNF.

View solution

Q. A functional dependency f on R is _______ by a set of functional dependencies F on r if every instance of r(R) that satisfies f also satisfies F.

View solution

Q. If F is a set of functional dependencies, then the closure of F is denoted by?

View solution

Q. If a functional dependency is reflexive, B is a subset of A and A is the set of attributes, then

View solution

Q. State true or false: Armstrong’s axioms allow us to generate all F+ for any given F

View solution

Q. Armstrong axioms are called sound because?

View solution

Q. State true or false: Functional dependencies are transitive

View solution

Q. If A→B, A→ C then which of the following is true?

View solution

Q. If B is an attribute and A→B, Then B is said to be ________ by a.

View solution

Q. We say that a decomposition having the property F’+ = F+ is a __________ decomposition.

View solution