Novel DR-tree index based on the diagonal line of MBR

The application of spatial database is increasingly widespread. How to effectively store and organize multidimensional space data and improve the processing efficiency of multidimensional data has become a central issue. R-tree is one of the most widely used spatial indexes. Due to the existing large overlap and coverage among the nodes of R-tree, the search path of a data object is not unique, and the search efficiency declines sharply when the amount of data increases. Based on the analysis and research of previous index trees, a novel DR-tree index based on the diagonal lines of MBR is proposed in this paper. DR-tree uses the diagonal line of MBR to indicate spatial data objects and construct R-tree, still adopt the endpoint coordinates of MBR diagonal to signify the location of leaf nodes or non-leaf nodes. Since MBR is simplified, the coverage and overlap among regions are also reduced. Experimental results show that the new index tree is superior to R-tree in performance. The query paths of data objects are single, the insertion, deletion, and query efficiency of data objects are significantly improved, and the performance of the new index tree becomes more apparent when the amount of data objects increases.