Suppose relation R(A,B,C) is decomposed into: R1(A,B) and R2(B,C). The — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2025 paper

Module 2: Relational Query Languages & Design

20252m

Suppose relation R(A,B,C) is decomposed into: R1(A,B) and R2(B,C). The decomposition is lossless if:

(i) B $\rightarrow$ A or B $\rightarrow$ C
(ii) A $\rightarrow$ B
(iii) A $\rightarrow$ C
(iv) C $\rightarrow$ B

Search Google Ask AI

Similar questions

Database Management SystemConsider the relation R (P, Q, S, T, X, Y, Z, W) with the following functional dependencies. PQ → X; P → YX; Q → Y; Y → ZW Consider the decomposition of the relation R into the constituent relations according to the following two decomposition schemes. D1 : R = [(P, Q, S, T); (P, T, X); (Q, Y); (Y, Z, W)] D2 : R = [(P, Q, S); (T, X); (Q, Y); (Y, Z, W)] Identify whether it is a lossless or lossy decomposition and justify your answer.20247m Database Management SystemWhen is the decomposition of relation schema R into two relation schemes X and Y, said to be a loss-less-join decomposition? Why is this property so important? Explain with example.20227m Database Management SystemFrom the instance of a relation scheme R (A, B, C) | A | B | C | |---|---|---| | 1 | 1 | 1 | | 1 | 1 | 0 | | 2 | 3 | 2 | | 2 | 3 | 2 | we can conclude that: (i) A functionally determines B and B functionally determines C (ii) A functionally determines B and B does not functionally determine C (iii) B does not functionally determine C (iv) A does not functionally determine B and B does not functionally determine C20192m Database Management SystemWrite a short note on: Dependency Preservation and Lossless Decomposition20257m

PreviousA relation is in BCNF if: (i) Every non-prime attribute depends on key (ii) Every FD is trivial (iii) Every determinant is a superkey (iv) Every attribute is atomic NextCompared with B-tree indexing, hashing is preferred when queries mainly involve: (i) Range searches (ii) Ordered traversal (iii) Exact match search (iv) Sorting