Question:
An OTT company is maintaining a large disk-based relational database of different movies with the following schema :
Movie (ID, Customer Rating)
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.Genre ID = Genre. ID;
This SQL query can be sped up using which of the following indexing options ?
An OTT company is maintaining a large disk-based relational database of different movies with the following schema :
Movie (ID, Customer Rating)
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.Genre ID = Genre. ID;
This SQL query can be sped up using which of the following indexing options ?
Movie (ID, Customer Rating)
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.Genre ID = Genre. ID;
This SQL query can be sped up using which of the following indexing options ?
Updated On: Jan 30, 2026
- B+ tree on all the attributes.
- Hash index on Genre.Name and B+ tree on the remaining attributes.
- Hash index on Movie.CustomerRating and B+ tree on the remaining attributes.
- Hash index on all the attributes.
Show Solution
Verified By Collegedunia
The Correct Option is A, B
Solution and Explanation
The correct option is (A) : B+ tree on all the attributes and (B) : Hash index on Genre.Name and B+ tree on the remaining attributes.
Was this answer helpful?
0
0
Top GATE DA Data Science and Artificial Intelligence Questions
- Consider performing depth-first search (DFS) on an undirected and unweighted graph G starting at vertex s. For any vertex u in G, d[u] is the length of the shortest path from s to u. Let (u, v) be an edge in G such that d[u] < d[v]. If the edge (u, v) is explored first in the direction from u to v during the above DFS, then (u, v) becomes a _____ edge.
- Three fair coins are tossed independently. T is the event that two or more tosses result in heads. S is the event that two or more tosses result in tails. What is the probability of the event T ∩ S?
- Consider the matrix \(M=\begin{bmatrix} 2 & -1 \\ 3 & 1 \end{bmatrix}\).
Which ONE of the following statements is TRUE ? - For any twice differentiable function ƒ: R → R, if at some x* ∈ R, f'(x*) = 0 and f'(x*) > 0, then the function f necessarily has a ______ at x = x*.
Note : R denotes the set of real numbers. - Match the items in Column 1 with the items in Column 2 in the following table :
Column 1 Column 2 (p) First In First Out (i) Stacks (q) Lookup Operation (ii) Queues (r) Last In First Out (iii) Hash Tables
View More Questions
Top GATE DA SQL Questions
Top GATE DA Questions
- Consider performing depth-first search (DFS) on an undirected and unweighted graph G starting at vertex s. For any vertex u in G, d[u] is the length of the shortest path from s to u. Let (u, v) be an edge in G such that d[u] < d[v]. If the edge (u, v) is explored first in the direction from u to v during the above DFS, then (u, v) becomes a _____ edge.
- Three fair coins are tossed independently. T is the event that two or more tosses result in heads. S is the event that two or more tosses result in tails. What is the probability of the event T ∩ S?
- Consider the matrix \(M=\begin{bmatrix} 2 & -1 \\ 3 & 1 \end{bmatrix}\).
Which ONE of the following statements is TRUE ? - For any twice differentiable function ƒ: R → R, if at some x* ∈ R, f'(x*) = 0 and f'(x*) > 0, then the function f necessarily has a ______ at x = x*.
Note : R denotes the set of real numbers. - Match the items in Column 1 with the items in Column 2 in the following table :
Column 1 Column 2 (p) First In First Out (i) Stacks (q) Lookup Operation (ii) Queues (r) Last In First Out (iii) Hash Tables
View More Questions