A new method about spatial data query based on the R*Q-tree

Based on the conventional R*Q-tree study, a novel R*Q-tree spatial database indexing technology is designed in order to solve the shortcoming of the conventional R*Q-tree to insert data into which quard. The novel R*Q-tree is created by adding the parent node VR*-tree and HR*-tree, making the data set of R*Q-tree near by partition forms of narrow-band line shape, the overlapping between the sub-tree of the R*-tree is greatly reduced and the scope of the entire spatial data is divided into narrow-band. There isn´t any repeat between the R*-tree and the sub-regions. The experiment shows that the query efficiency of the improved R*Q-tree is significantly enhanced.