DocumentCode
1722692
Title
A new HR-tree index based on hash address
Author
Li, Guobin ; Tang, Jine
Author_Institution
Sch. of Comput. Sci. & Technol., Henan Polytech. Univ., Jiaozuo, China
Volume
3
fYear
2010
Abstract
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.
Keywords
file organisation; sorting; tree data structures; HR-tree index; MBR; hash address sorting; Algorithm design and analysis; Signal processing; Signal processing algorithms; Sorting; Spatial databases; Spatial indexes; MBR; R-tree; hash address sorting;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Systems (ICSPS), 2010 2nd International Conference on
Conference_Location
Dalian
Print_ISBN
978-1-4244-6892-8
Electronic_ISBN
978-1-4244-6893-5
Type
conf
DOI
10.1109/ICSPS.2010.5555818
Filename
5555818
Link To Document