Computer Science, asked by AkashSPK, 1 year ago

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

Answers

Answered by trisha42
1
(b) hash tables answer

AkashSPK: is it correct
trisha42: i had read about it in my Friend's note book
AkashSPK: thanks yaar
trisha42: welcome
Similar questions