Splitting a node Split a node with entries into two nodes having at least entries each Minimize the probability that both the new nodes are accessed during a search Minimize the sum of probabilities of accessing the two nodes   Requires knowledge of query Probability is directly correlated to volume of MBR   Therefore, minimize sum of volumes