DBT: 6 Indexing 3 (Hash Tables)

Practice questions on hash indexes, collision handling, open addressing, and dynamic hashing (extensible and linear hashing).

Progress

0/30

Question 1

1 point(s)

For which type of query is a Hash Index generally superior to a B+ Tree?

A. Range Queries (e.g., salary BETWEEN 50000 AND 60000)

B. Point Queries (e.g., id = 105)

C. Prefix Searches (e.g., name LIKE 'Sm%')

D. Sorting data