Research on the Improved Algorithm of Node Split

摘要

The index dynamic operation includes three operations such as search operation insert operation and delete operation. In the inserting operation it possibly results node overflow. So it needs to use the node splitting algorithm to realize the inserting new node operation. R-tree search performance depends on the cover and overlap two parameters. Overlapping minimize is more critical than forehead minimization. This algorithm put forward in R - tree node apart, according to make the principle of least overlapping. It will divided nodes into two parts. Then it adjusts the position of already insert node and inserts the new node in the new position. The R-tree improved algorithm performances well in the search operation.