New hybrid index structure RBRT tree

The efficient index structure has important applications in the massive data query. According to the deficiency of the R-tree in the data cluster and the blank space utilization, a new hybrid index structure R^BRT tree was presented based on the minimum bounding rectangle (MBR) and the minimum bounding right trapezoid (MBRT). The characteristics of the spatial plane partition and the spatial data structure were discussed and the operating algorithms for the R^BRT tree were studied. The methods for the extension of the R^BRT tree were also discussed, Furthermore, the comparison and analysis for the R^BRT tree and the R-tree were made. It concludes that the R^BRT tree has advantages on the blank space utilization, search accuracy and data storage for some datasets compared with R tree.