By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shaohui Zhang ; Dept. of Comput. Sci., Zhoukou Normal Univ., Zhoukou, China ; Zhanwei Chen

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.

Published in:

Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on  (Volume:7 )

Date of Conference:

12-14 Aug. 2011