A new variation of R-tree for indexing spatial data in GIS

R-tree, a dynamic indexing structure constructed with enclosing rectangle of spatial objects, is one of the most popular methods for accessing spatial database. The difference of those existing methods of R-tree mainly focuses on selecting the optimization criteria in building a tree. These existing methods are suitable for spatial objects that their enclosing rectangles are apart or overlapped with each other in space. However, in real world there is another fact that sometimes the enclosing rectangle of a spatial object will contain another´s. In such case, a new data structure is created. And algorithms for inserting, splitting and adjusting are described in detail. Finally, a test for this new algorithm is implemented as well.