Question

Given that the database buffer sizes are very large, what data structure would you use for efficient search? Marks: MCQ
a) B+ trees
b) Hash tables
c) Fibonacci heaps
d) Red-Black trees

Answer 1

(b) option is right

Answer 2

The answer is b) Hash tables.    

Given that the database buffer sizes are very large, the hash tables data structures are used for efficient search. These data structures can be used for fast retrieval of an item from a data set. A hash table can be used for the mapping of keys to values.