a) All keys hash to same index
b) All keys hash to different indices
c) All keys hash to an even-numbered index
d) All keys hash to different even-numbered indices
Answer: a
Explanation: If all keys hash to the same location then the i-th inserted key would need i lookups to be found. The probability of looking up i-th key is 1/n (since it’s random). If you know some probability it’s trivial to show that such lookups have linear time.
Related Posts
A _________________ index is the one which satisfies all the columns requested in the query without performing further lookup into the clustered index.
In _______________ index instead of storing all the columns for a record together, each column is stored separately with all other rows in an index.
If an index is _________________ the metadata and statistics continue to exists
What are composite indexes?
Does index take space in the disk?:
What is true about indexes?
Which one is true about clustered index?
Join The Discussion