retagged by
199 views
1 votes
1 votes

Let $\mathrm{R}(a, b, c, d)$ be a RDBMS relation having the following set of functional dependencies (FD set) :
FD Set $$\mathrm{F}=\{b \rightarrow c ; c \rightarrow d ; ab \rightarrow d ; bc \rightarrow cd\}$$

We apply some queries on a relational instance $r$ of $\text{R}$. Which of the following queries are guaranteed to return the same number of tuples as in relation instance $r$?

  1. $\prod_a(r)$
  2. $\prod_{a, c}(r)$
  3. $\prod_{a, b}(r)$
  4. $\prod_{a, b, d}(r)$
retagged by

1 Answer

2 votes
2 votes
From the given FD set we can find candidate key which is “$ab$” because these attributes do not appear on the RHS of any FD.
The number of tuples in a relation resulting from a PROJECT operation is always less than or equal to the number of tuples in $\text{R}$.
If the projection list is a superkey of $\text{R}$—that is, it includes some key of $\text{R}$— the resulting relation has the same number of tuples as $\text{R}.$
Answer:

Related questions

123
views
1 answers
1 votes
GO Classes asked Apr 30, 2023
123 views
Please mark the functional dependencies that are consistent with the following table. ... $\mathrm{ABC} \rightarrow \mathrm{D}$
497
views
1 answers
1 votes
GO Classes asked Apr 30, 2023
497 views
Here's a relation $(\mathrm{R})$, its attributes and its functional dependencies $(\mathrm{F})$ ... $\mathrm{E} \rightarrow \mathrm{CD}$