A New R*Q-tree Spatial Index based on the Delaying Selection and Clustering Splitting

The original R*Q-tree is an important class of query index in the spatial database, but when carry on frequent insertion and deletion, the efficiency is very low, because its construction cost is much more than that of the other query methods. So the new R*Q-tree using the delaying and Clustering splitting technology has been proposed for improving the shortcomings of the original R*Q-tree. When the data objects are inserted into the new R*Q-tree, the nodes may overflow. During the process of insertion, rather than split the node immediately, it attempts to insert the nodes into the adjacent neighboring nodes by using of the delaying selection splitting technology until they are full. If the adjacent neighboring nodes are full, it will use the clustering technology to split the nodes, data items will be reorganized between the neighboring nodes and the splitted nodes. The new R*Q-tree can ensure the premise of the query performance and the cost of structure greatly reduced, at the same time, significantly the space utilization of the index structure is improved. Finally, the experimental analysis and appraisals show that the operation efficiency of the new R*Q-tree is enhanced. And in the new R*Q-tree and the promoter region, there are no duplicated elements, so the structure of the new R*Q-tree can be simplified.