adplus-dvertising
frame-decoration

Question

The rule that always generate true dependencies is called

a.

referential rule

b.

inferential rule

c.

closure rule

d.

reflexive rule

Posted under DBMS

Answer: (d).reflexive rule

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The rule that always generate true dependencies is called

Similar Questions

Discover Related MCQs

Q. In the __________ normal form, a composite attribute is converted to individual attributes.

Q. A table on the many side of a one to many or many to many relationship must:

Q. Tables in second normal form (2NF):

Q. Which-one ofthe following statements about normal forms is FALSE?

Q. Functional Dependencies are the types of constraints that are based on______

Q. Which is a bottom-up approach to database design that design by examining the relationship between attributes:

Q. Which forms simplifies and ensures that there is minimal data aggregates and repetitive groups:

Q. Which forms has a relation that possesses data about an individual entity:

Q. Which forms are based on the concept of functional dependency:

Q. Empdt1(empcode, name, street, city, state,pincode).

For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In normalization terms, empdt1 is a relation in

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

Q. Which of the following is not a Armstrong’s Axiom ?

Q. The relation employee(ID,name,street,Credit,street,city,salary) is decomposed into

employee1 (ID, name)
employee2 (name, street, city, salary)

This type of decomposition is called

Q. Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into

instructor (ID, name, dept name, salary)
department (dept name, building, budget)

This comes under

Q. 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

Q. 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:

Q. Suppose we wish to find the ID’s of the employees that are managed by people who are managed by the employee with ID 123. Here are two possible queries:

I.SELECT ee.empID

FROM Emps ee, Emps ff

WHERE ee.mgrID = ff.empID AND ff.mgrID = 123;

II.SELECT empID

FROM Emps

WHERE mgrID IN

(SELECT empID FROM Emps WHERE mgrID = 123);

Which, if any, of the two queries above will correctly (in SQL2) get the desired set of employee ID’s?

Q. Suppose relation R(A,B) currently has tuples {(1,2), (1,3), (3,4)} and relation S(B,C) currently has {(2,5), (4,6), (7,8)}. Then the number of tuples in the result of the SQL query:

SELECT *
FROM R NATURAL OUTER JOIN S;

Q. Suppose now that R(A,B) and S(A,B) are two relations with r and s tuples, respectively (again, not necessarily distinct). If m is the number of (not necessarily distinct) tuples in the result of the SQL query:

R intersect S;

Then which of the following is the most restrictive, correct condition on the value of m?

Q. Suppose relation R(A,B,C,D,E) has the following functional dependencies:
A -> B

B -> C

BC -> A

A -> D

E -> A

D -> E

Which of the following is not a key?