Question: 2. Suppose one block holds 1,024 bytes and each key uses 128 bytes and a branch(link field) is 32 bytes. a) In a B-tree

2. Suppose one block holds 1,024 bytes and each key uses 128 




2. Suppose one block holds 1,024 bytes and each key uses 128 bytes and a branch(link field) is 32 bytes. a) In a B-tree of order M with L leaves, what is the largest value of M? b) If each data record is 256 bytes, what is maximum L value? c) What is the range of the number of keys in a non-leaf node(except the root)? d) Based on your answer, if there are 5 million records, how many leaves at most will this B-tree have?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Lets address each part of the question Given Block size 1024 bytes Key size 128 bytes Branch link fi... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!