Question

Consider a relational schema team(name,city,owner)\textit{team}(\textit{name}, \textit{city}, \textit{owner}), with functional dependencies {name→city,  name→owner}\{\textit{name} \to \textit{city}, \; \textit{name} \to \textit{owner}\}.

The relation team\textit{team} is decomposed into two relations, t1(name,city)t_1(\textit{name}, \textit{city}) and t2(name,owner)t_2(\textit{name}, \textit{owner}). Which of the following statement(s) is/are TRUE?

Choose every correct option
Official answer and solution
Official answer
B and C
From
Official GATE 2025 answer key

Solution

Find the candidate key of team, t1, and t2, and check the BCNF and lossless-join conditions.

  1. In team(name,city,owner)\textit{team}(\textit{name}, \textit{city}, \textit{owner}), the closure of {name}\{\textit{name}\} is {name,city,owner}\{\textit{name}, \textit{city}, \textit{owner}\}, so name\textit{name} is the sole candidate key. Since both FDs name→city\textit{name} \to \textit{city} and name→owner\textit{name} \to \textit{owner} have a superkey on the left-hand side, team\textit{team} is already in BCNF (and hence in 3NF). Thus (A) and (D) are false.
  2. In t1(name,city)t_1(\textit{name}, \textit{city}) with name→city\textit{name} \to \textit{city} and t2(name,owner)t_2(\textit{name}, \textit{owner}) with name→owner\textit{name} \to \textit{owner}, name\textit{name} is a superkey in both relations, so both t1t_1 and t2t_2 are in BCNF ((B) is TRUE).
  3. The common attribute is t1∩t2={name}t_1 \cap t_2 = \{\textit{name}\}, which is a key for both t1t_1 and t2t_2, so the decomposition is a lossless join ((C) is TRUE).
Final answer

Options (B), (C)

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2025 Computer Science and Information Technology - Session 1 (CS1)
Question
47 of 65
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.