'A puzzle on the branching factor of MySQL B+ tree
In B+ Tree wiki, we could see that
The order, or branching factor, b of a B+ tree measures the capacity of nodes (i.e., the number of children nodes, typically 100+) for internal nodes in the tree. The actual number of children for a node, referred to here as m, is constrained for internal nodes so that
b / 2 < m < b.
AFAIK, the size of a tree node is typically fixed, like in MySQL, the default page size is 16K. I wonder how to make sure that m is bigger than b / 2 if the search keys in the internal node are too large? for example a big search key is 1K, so an internal node can only contain at most 16 search keys, which is far less than 100, right?
Another question how to determine the branching factor b?
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|