+1 vote
in Data Structures & Algorithms I by (110k points)
Compression techniques can be used on the keys to reduce both space and time requirements in a B-tree.

(a) True

(b) False

My query is from B-Trees topic in portion B-Trees of Data Structures & Algorithms I

I have been asked this question in an interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct answer is (a) True

Easiest explanation - The front compression and the rear compression are techniques used to reduce space and time requirements in B-tree. The compression enables to retain more keys in a node so that the number of nodes needed can be reduced.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.