edited by
280 views
0 votes
0 votes

A functional dependency of the form x → y is trivial if

  1. y ⊆ x
  2. y ⊂ x
  3. x ⊆ y
  4. x ⊂ y
edited by

1 Answer

1 votes
1 votes

here we talk about trivial dependency so its clearly  x---->y means  y ⊆ x   so its Trivial.

hence option A  is correct.

Answer:

Related questions

368
views
1 answers
1 votes
Bikram asked Nov 26, 2016
368 views
Consider the join of relation R with a relation S. If R has $m$ tuples and S has $n$ tuples, then the maximum and minimum sizes of the join, respectively, are __________.$m+n$ and $0$m+n$ and $|m-n|$mn$ and $0$mn$ and $m+n$
352
views
1 answers
0 votes
Bikram asked Nov 26, 2016
352 views
What does the following Tuple Relational Calculus query produce?The expression σθ1 (E1 ⋈θ2 E2) is the same as: E1 ⋈θ1^ θ2 E2 (σθ1 E1) ∧ (σθ2 E2 ) E1 ⋈ θ1∨ θ2 E2 None of the above
362
views
1 answers
0 votes
Bikram asked Nov 26, 2016
362 views
What does the following relational algebra expression represent ?Consider the relations given below with keys in Bold :Branch (branch no, street, city)Staff (staff ... Staff) - Π staffNo (propertyForRent)Π staffNo (Staff) * ΠstaffNo(rent)
344
views
1 answers
1 votes
Bikram asked Nov 26, 2016
344 views
Consider the following relationsEmployee (E#, Ename, salary, Bdate, D#)Department (D#, Dname, mgremp#, Location)Dependent (E#, DependentName)Which among these tuple calculus queries represent the ... ∧ t[E#] = u[D#] ∧ m[E#] = u[D#])}