An improved Spatial index based on the R*Q-tree

In order to solve the problem of the conventional R*Q-tree about inserting the data object into which queue, a new R*Q-tree spatial database indexing technology is proposed based on the analysis of the conventional R*Q-tree, the new R*Q-tree is created by adding the parent node pointers VP and HP, making the data set of R*Q-tree in the partition forms of narrow-band line shape, the overlapping and coverage between the sub-trees of the R*-tree can be greatly reduced, at the same time, the entire area of the spatial data objects is divided into narrow-band. So there exists no repetition between the R*-tree and the sub-regions. The experiment shows that the query efficiency of the improved R*Q-tree is significantly enhanced, and it can achieve the quick index in the massive data set.