An improved Spatial index based on the R*Q-tree
In order to solve the problem of the conventional R*Qtree about inserting the data object into which queue, a new R*Qtree spatial database indexing technology is proposed based on the analysis of the conventional R*Qtree, the new R*Qtree is created by adding the parent node pointers VP and HP, making the data set of R*Qtree in the partition forms of narrowband line shape, the overlapping and coverage between the subtrees of the R*tree can be greatly reduced, at the same time, the entire area of the spatial data objects is divided into narrowband. So there exists no repetition between the R*tree and the subregions. The experiment shows that the query efficiency of the improved R*Qtree is significantly enhanced, and it can achieve the quick index in the massive data set.
R*Q-tree R-tree R*-tree SpatialDatabaseIndex
Quanyou Song
Department of Information and Communication Engineering, Henan Vocational and Technical College of Communications, Zhengzhou, China
国际会议
广州
英文
1-4
2011-05-13（万方平台首次上网日期，不代表论文的发表时间）