By Topic

Research on distributed Hilbert R tree spatial index based on BIRCH 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

4 Author(s)
Yizhou Yang ; Inst. for Geo-Inf. & Digital Mine Res., Northeastern Univ., Shenyang, China ; Lixin Wu ; Jiateng Guo ; Shanjun Liu

Spatial index is the foundation of spatial database, while efficiency improvement of traditional serial spatial index has nearly reached its limit, it is therefore necessary to develop parallel spatial index approaches to break the bottleneck in accessing the root node in serial mode. This paper proposes a parallel spatial index called Hilbert R tree index, which can be carried on multicore CPU and computer cluster for parallel spatial queries and data retrieval. This new index method utilizes BIRCH clustering algorithm for spatial classification and data partition before distributed data deployment, considering geographic data characteristics; and creates spatial index in parallel environment by using of Hilbert filling curve. The test results demonstrate that parallel Hilbert R tree index based on BIRCH clustering algorithm can not only maintain internal spatial relations and the attributes of geographic dataset, but also has efficient performance in partitioning and retrieving spatial data.

Published in:

2012 20th International Conference on Geoinformatics

Date of Conference:

15-17 June 2012