Question

Using a B-Tree, we want to store and process information concerning the driving records for citizens in
the Washington state. We assume the following:
we have 1,000,000 items,
each key is 4 bytes (ID number),
a record is 128 bytes,
one disk block holds 4096 bytes,
and a pointer to each block is of size 4 bytes.
What should be the order of the Tree M =
How many data records can be stored in the leaf node L =
What will be the height of the B-Tree for given n items
Remember that the root is kept in main memory at all times.​

Answer 1

Answer:

Using a B-Tree, we want to store and process information concerning the driving records for citizens in

the Washington state. We assume the following:

we have 1,000,000 items,

each key is 4 bytes (ID number),

a record is 128 bytes,

one disk block holds 4096 bytes,

and a pointer to each block is of size 4 bytes.

What should be the order of the Tree M =

How many data records can be stored in the leaf node