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

Q. A _________ Fc for F is a set of dependencies such that F logically implies all dependencies in Fc, and Fc logically implies all dependencies in F.

View solution

Q. What does the BCNF decomposition algorithm do?

View solution

Q. The 3NF decomposition algorithm is also called as _______

View solution

Q. Which of the following is desirable in a database design with functional dependencies?

View solution

Q. Which of the following is not a process of generating a good relational schema?

View solution

Q. What is unique role assumption?

View solution

Q. The process of making a normalized schema unnormalized is called as _________

View solution

Q. State true or false: Crosstabs are not desirable in a database design

View solution

Q. The data that have a time interval associated with them during which they are valid are called as ________

View solution

Q. The value of the data at a particular time is called as?

View solution

Q. Functional dependencies that have a time associated with them during which they are valid are called as________

View solution