a) Less than 1
b) Less than n
c) Less than m
d) Less than n/2
Answer: a
Explanation: Hashing is also a method of sorting key values in a database table in an efficient manner.
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