672 views
0 votes
0 votes

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.
 

1 Answer

1 votes
1 votes
$A_p = C$ -Hashing would mean constant time to get the tuple from the index.

$C_1 \leq A_p \leq C_2$- We need to scan a range of values in index to determined the matching tuples.

So, C should be the answer.

Related questions

1 votes
1 votes
0 answers
1
Sahil Gupta asked Nov 25, 2014
742 views
Answer the following part:a) Show that, under the assumption that the input is equally likely to be any of the n! permutations of theseintegers, the average number of com...
2 votes
2 votes
1 answer
2
1 votes
1 votes
1 answer
3
0 votes
0 votes
1 answer
4
tishhaagrawal asked Dec 16, 2023
311 views
Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...