DocumentCode
3367452
Title
The research of Hilbert R-Tree spatial index algorithm based on hybrid clustering
Author
Shaohui Zhang ; Zhanwei Chen
Author_Institution
Dept. of Comput. Sci., Zhoukou Normal Univ., Zhoukou, China
Volume
7
fYear
2011
fDate
12-14 Aug. 2011
Firstpage
3495
Lastpage
3497
Abstract
In this paper, the R-Tree spatial index structure was analyzed. There are overlap between brother nodes and multi-path in search, which can not effectively reduced by Hilbert R-Tree. Based on hybrid spatial clustering algorithm, a spatial index algorithm is proposed. Experiments show that the algorithm has the faster response speed and the higher query efficiency.
Keywords
pattern clustering; query processing; spatial data structures; tree data structures; Hilbert R-tree structure; hybrid clustering; hybrid spatial clustering algorithm; query efficiency; spatial index algorithm; Algorithm design and analysis; Buildings; Classification algorithms; Clustering algorithms; Spatial databases; Spatial indexes; Hilbert R-Tree; Hybrid Clustering; Spatial Index; Spatial Query;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on
Conference_Location
Harbin, Heilongjiang
Print_ISBN
978-1-61284-087-1
Type
conf
DOI
10.1109/EMEIT.2011.6023777
Filename
6023777
Link To Document