A new solution of node splitting to the R Tree algorithm
Liang Wang, Songnian Yu, Feng Chen · 2010
This paper aims to present a new solution about node splitting to overcome the disadvantage which Guttman described in his paper. By comparing with the node splitting algorithm which tries to solve the “remaining entries” problem and the general node splitting algorithm which requires quadratic time, the result of this study indicates that multipath query has decreased and the performance of spatial query has improved effectively due to smaller overlap was brought.