Consider a relational table r with sufficient number of records, having attributes A₁, A₂,... A_n, let 1 ≤ p ≤ n . Two queries Q₁ and Q₂ are given below.
Q₁ = πA₁ ...............A_p where c is constant .
Q₂ = πA₁ ...............A_p (σ_c1 ≤ A_p ≤ c₂ ) and c₁ and c₂ are constants.
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