Assume one file has records. Each record takes R = 100 bytes, of which 10 bytes are for the key of the record. Suppose the key values range from 1…

Assume one file has   records. Each record takes R = 100 bytes, of which 10 bytes are for the key of the record. Suppose the key values range from 1 through 1,000,000, inclusive. Assume the block size B is 1000 bytes for all files, and that an address (block pointer, tree node pointer, or data record pointer) takes 10 bytes.
What is the number of B-+tree internal nodes at the lowest level needed  if blocks are approximately 69% full (round up for convenience)?
(Please note this internal level is just above the B-+tree leaf node level). I just need final answer

 

"Is this question part of your assignment? We Can Help!"

Essay Writing Service