Back to the 2022 paper
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.20247mDatabase Management SystemSuppose 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 B20252mDATABASE MANAGEMENT SYSTEMWhich of the following is generally used for performing tasks like creating the structure of the relations or deleting relations? - (i) DML - (ii) Query - (iii) Relational schema - (iv) DDL20242mDATABASE MANAGEMENT SYSTEM__________ operations do not preserve non-matched tuples. - (i) Inner join - (ii) Left outer join - (iii) Query - (iv) Relational schema20242m