Directions (Q96–100): Consider the relations X(S, Si, C) and Y(S, P, D):
| X | ||
|---|---|---|
| S | Si | C |
| J | 1 | M |
| B | 2 | N |
| R | 3 | H |
| T | 4 | G |
| Y | ||
|---|---|---|
| S | P | D |
| J | S1 | CA |
| B | P1 | AB |
| R | D1 | DC |
| A | H1 | MD |
The result of the operation X ⟖X.S = Y.S Y (right outer join) will be:
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B.
S Si C P D J 1 M S1 CA B 2 N P1 AB R 3 H D1 DC A NULL NULL H1 MD
Explanation
A right outer join keeps every Y tuple: J, B, R match, and A (only in Y) appears with NULL for Si and C.More Database Management Systems questions
- Which join is used to get all the tuples of relations X and Y, with NULL values for the corresponding missing values?
- The number of tuples obtained by applying a right outer join on relations X and Y is:
- The number of tuples obtained by applying the Cartesian product over X and Y is:
- The total cost of retrieving records in sorted order using an unclustered B+ tree is (P = average number of records per data page, N = numb…
- Let R(A, B, C, D) be a relational schema with functional dependencies A → B, B → C, C → D and D → B. The decomposition of R into (A, B), (B…
- Consider the following statements: A. A database design is in BCNF if each member of the set of relation schemas that constitutes the desig…