The research of Hilbert R-Tree spatial index algorithm based on hybrid clustering

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

Full description

Saved in:
Bibliographic Details
Published in2011 International Conference on Electronic and Mechanical Engineering and Information Technology Vol. 7; pp. 3495 - 3497
Main Authors Shaohui Zhang, Zhanwei Chen
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2011
Subjects
Algorithm design and analysis
Buildings
Classification algorithms
Clustering algorithms
Hilbert R-Tree
Hybrid Clustering
Spatial databases
Spatial Index
Spatial indexes
Spatial Query
Online AccessGet full text
ISBN9781612840871
1612840876
DOI10.1109/EMEIT.2011.6023777

Cover

More Information
Summary: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.
ISBN:9781612840871
1612840876
DOI:10.1109/EMEIT.2011.6023777