DocumentCode :
1845189
Title :
Parallel Spatial Index Algorithm Based on Hilbert Partition
Author :
Li Xun ; Zheng Wenfeng
Author_Institution :
Dept. of Autom. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
fYear :
2013
fDate :
21-23 June 2013
Firstpage :
876
Lastpage :
879
Abstract :
R-tree and its varieties are the main indiecs in spatial databases. With the increasing large amount of spatial data and its complexity, traditional database management methods´ processing time grows rapidly. In this paper we present a novel spatial index method that takes advantage of the parallel distributed storage system by using the Hilbert curve and MapReduce computation model. The experiment shows good result of time performance and efficiency.
Keywords :
Hilbert spaces; curve fitting; parallel programming; storage management; trees (mathematics); visual databases; Hilbert curve; Hilbert partition; MapReduce computation model; R-tree; database management methods; parallel distributed storage system; parallel spatial index algorithm; spatial databases; Buildings; Complexity theory; Educational institutions; Partitioning algorithms; Spatial databases; Spatial indexes; R-trees; distribute algrithm; hilbert partition; spatial database; spatial index;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational and Information Sciences (ICCIS), 2013 Fifth International Conference on
Conference_Location :
Shiyang
Type :
conf
DOI :
10.1109/ICCIS.2013.235
Filename :
6643151
Link To Document :
بازگشت