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 M8R 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.

关键词： R-tree MBR hash address sorting

作者: Guobin Li Jine Tang

作者单位: School of Computu Science and Technology Henan Polytechnic University Jiaozuo, China School ofComputer Science and Technology Henan Polytechnic University Jiaozuo, China

会议类型: 国际会议

会议名称: 2010 2nd International Conference on Signal Processing System(2010年信号处理系统国际会议 ICSPS 2010)

会议地点: 大连

会议语种:英文

页码: 1716-1719

在线出版日期: 2010-07-05（万方平台首次上网日期，不代表论文的发表时间）