Search

• Node size should be equal to disk page size.
• Disk Accesses = , where n is #keys in B-tree
• Run Time = O(th) = O(t $\log_t n$) = O(lg n), if t is constant

Example

Disk page size = 2048 bytes

4 bytes per key, 4 bytes per pointer, 4 bytes extra

Full node has (2t - 1) keys and 2t child pointers: 16t bytes per node

16t = 2048, t = 128