Consider a relational table r with sufficient number of records, having attributes A₁, A₂,..., A_n and let 1 ≤ p ≤ n. Two queries Q1 and Q2 are given below.
Q1:πAi...Ap(σAp=c(r)) where c is a constant
Q2:πAi...Ap(σc1≤Ap≤c2(r)) where c1 and c₂ are constant
The database can be configured to do ordered indexing on A_p or hashing on A_p. Which of the following statements is TRUE?

Question

Examsnet · Accepted Answer

Correct Answer is : Hashing will outperform ordered indexing on Q1, but not on Q2

GATE Computer Science (CS) 2011 Solved Paper