Improved R~*-tree spatial index

R*-tree spatial index manages nodes based on the idea of partial adjustment,but lacks time and efficiency.In order to overcome the shortages of R*-tree,the paper proposed a new storage structure,and the algorithms of insertion,overflow and split for the new storage structure.The merits of the storage structure were analyzed.Experiments verify the new storage structure is more efficient than R*-tree.