A new HR-tree index based on hash address

R-tree spatial index is a very common database index tree, R-tree has a wide application system as a common spatial index with a dynamic data structure in GIS. In this paper, based on the establishment method of the traditional R-tree, carry on hash address sorting to the MBR of the each node in every level of the R-tree, hash address is determined by the location of the MBR, it can well implement the inserting, deleting, querying operation in the new HR-tree, and has a good use value in practical applications.