Open In App

GATE | GATE CS 2011 | Question 39

Like Article
Like
Save
Share
Report

Consider a relational table r with sufficient number of records, having attributes A1, A2,…, An and let 1 <= p <= n. Two queries Q1 and Q2 are given below. GATE2011DBMS1

The database can be configured to do ordered indexing on Ap or hashing on Ap. Which of the following statements is TRUE?
(A) Ordered indexing will always outperform hashing for both queries
(B) Hashing will always outperform ordered indexing for both queries
(C) Hashing will outperform ordered indexing on Q1, but not on Q2
(D) Hashing will outperform ordered indexing on Q2, but not on Q1.


Answer: (C)

Explanation: If record are accessed for a particular value from table, hashing will do better. If records are accessed in a range of values, ordered indexing will perform better. See this for more details.

Quiz of this Question


Last Updated : 07 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads