algorithm - Fan out in B+ trees -
how fan out affects split , merge in b+ trees? if have 1024 bytes page , 8 byte key, , maybe 8 byte pointer, can store around 64 keys in 1 page. considering 1 page node, if have fan out of 80%, mean split happen after node 80% full after 52 keys inserted or after node overflows. same merge, when merge nodes if have 80% fan out, when keys go less half size of node or 80% has it. splits , merges in b-trees of kinds driven policies based on fullness criteria. best think fullness in terms of node space utilisation instead of key counts; fixed-size structures - space utilisation measured in terms of key counts , equivalent fanout - tend occur in academia , special contexts in-memory b-trees on integers or hashes. in practice there variable-size elements involved, beginning variable-size keys subject further size variation via things prefix/suffix truncation , compression. splits invariably occur when update operation result in overflowed node. difference between polici...