GATE Papers >> CSE >> 2011 >> Question No 39

Question No. 39 CSE | GATE 2011

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.

Q1: π A1......ApσAp=cr  where c is a constant

Q2: π A1......Apσ c1Apc2r where c1 and c2 are constants

The database can be configured to do ordered indexing on Ap or hashing on Ap. Which of the following statements is TRUE?

Answer : (C) Hashing will outperform ordered indexing on Q1, but not on Q2

No Comments
Leave a comment