2. Suppose one block holds 1,024 bytes and each key uses 128 bytes and a branch(link...

 

Transcribed Image Text:

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? 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?

Answer rating: 100% (QA)

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