B-Tree nodes then...

• So we actually want to pack as many index records into each block as possible.

• How large is an index record?

  • number of bytes to maintain a key
  • number of bytes to maintain a data file block reference.

• You also need to account for the child block references.