Optimization research of spatial index structure of R*-tree

Aiming at the need of very large spatial database applications and taking notice of the disadvantagesf existing spatial indexes, the thesis introduces an improved R*-tree spatial indexing structure after addressing the related concepts, data structures, algorithms, and performannalyses of R-tree and R*-tree. This paper gave a more efficient algorithm which analyses the shortcoming of R*-tree spatial index algorithm. The experiment results show that improved R*-tree is better than the original R*-tree in index efficiency.