A Spatial Database Index Method Based on Doubletree Structure

This study puts forward a new algorithm with double R-tree (DR-tree) in order to solve the issues caused by tremendous data size, namely, deepening depth of R-tree, increasingly large occupied space and low query efficiency. This study gives out the data structure, as well as the algorithm of insert, index and delete. According to the experiments, DR-tree will supply higher efficiency at the expense of slightly more occupied space. Moreover, the more the index objectives, the better retrieval performance can be delivered.