Normalization, Storage and Indexing - Database Management and Warehousing - Data Science & Artificial Intelligence Previous Year Questions

Given the relational schema \( R = (U, V, W, X, Y, Z) \) and the set of functional dependencies:
\(\{U \rightarrow V, U \rightarrow W, WX \rightarrow Y, WX \rightarrow Z, V \rightarrow X\}\)
Which of the following functional dependencies can be derived from the above set?

An OTT company is maintaining a large disk-based relational database of different movies with the following schema:
Movie(ID, CustomerRating)
Genre(ID, Name)
Movie_Genre(MovieID, GenreID)
Consider the following SQL query on the relation database above:
SELECT *
FROM Movie, Genre, Movie_Genre
WHERE
  Movie.CustomerRating > 3.4 AND
  Genre.Name = “Comedy” AND
  Movie_Genre.MovieID = Movie.ID AND
  Movie_Genre.GenreID = Genre.ID;
This SQL query can be sped up using which of the following indexing options?

If a relational decomposition is not dependency-preserving, which one of the following relational operators will be executed more frequently in order to maintain the dependencies?

Consider a database relation R with attributes ABCDEFG, and having the following functional dependencies:
\(A \rightarrow BCEF\) \(E \rightarrow DG\) \(BC \rightarrow A\)
Which of the following statements is/are correct?

Let R(A, B, C, D, E) be a relational schema with functional dependency set F={A→BC, CD→E, E→A}.

Which of the following statements is correct?

In a relational database, a B+ Tree Index is to be constructed for a relation on a key field. In a B+ Tree, a Node Pointer points to a sub-tree and a Data Record Pointer points to a block of database records.
Let, Node size = 4096 bytes, Node Pointer size = 10 bytes, Search Key Field size = 11 bytes and Data Record Pointer size = 12 bytes.
The maximum number of Node Pointers that can be present in a non-leaf node of the B+ Tree is __________. (Answer in integer)

Consider a B+ Tree where the maximum number of key values in each leaf node is 2 and the maximum number of pointers in each non-leaf node is 3. Let the content of the B+ Tree be as shown in the figure.
Which of the following options denotes the key value(s) stored in the root node after inserting a key value 3 in the given B+ Tree?

Consider an ER model with the entities E1(A11, A12, A13) and E2(A21, A22, A23), where, A11, A12, A13 are the attributes of E1, and A21, A22, A23 are the attributes of E2. Let A22 be a multi-valued attribute. A11 and A21 are the primary keys of E1 and E2, respectively.
Let R12 be a many-to-many relationship between E1 and E2. Participation of both E1 and E2 in R12 is total.
The minimum number of relations required to convert the ER model into relational model (assuming there is no other functional dependency) where each relation is in third normal form (3NF) is __________ . (Answer in integer)