A novel index structure R*Q-tree based on lazy splitting and clustering

The original R*Q-tree is the most popular query index of special database, but it is not suitable for the situation of frequent insertion and deletion, because its´ construction cost is much more than the other query methods. Therefore, the novel R*Q-tree splitting technology has been proposed as for improving the shortcomings of the original R*Q-tree. When the novel R*Q-tree has objects inserted into it the nodes may overflow. During this, rather than split the node immediately, it attempts to insert nodes in the adjacent neighboring nodes until they were full. Then it uses clustering technology to split the nodes, data items were reorganized the nodes between in the neighboring nodes and spitted nodes. The novel R*Q-tree ensuring the premise of query performance greatly reduced the cost of structure and significantly improve the space utilization of the index structure. Finally, the analysis and experiments show that the efficiency of the novel R*Q-tree is improved. But also among the novel R*Q-tree and the promoter region, there is no duplication elements, which made structure of the novel R*Q-tree simplified.