GATE | CS | 2011 | DBMS | Tuple calculus | Question 39

Last Updated :
Discuss
Comments

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?

Ordered indexing will always outperform hashing for both queries

Hashing will always outperform ordered indexing for both queries

Hashing will outperform ordered indexing on Q1, but not on Q2

Hashing will outperform ordered indexing on Q2, but not on Q1.

This question is part of this quiz :

GATE CS 2011,ER and Relational Models,DBMS GATE CS PYQ QUIZ,Tuple Calculus GATE CS PYQ Quiz
Tags:
GATE
DBMS Quiz
DBMS
GATE CS
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy