DocumentCode
501265
Title
Optimization Reearch of Multi-dimensional Indexing Structure of R*-Tree
Author
Tan, Ning ; Shi, Yue-Xiang
Author_Institution
Inf. Eng. Coll., XiangTan Univ., Xiangtan, China
Volume
2
fYear
2009
fDate
15-17 May 2009
Firstpage
612
Lastpage
615
Abstract
Aiming at the shortcoming of forced reinsert algorithm in R*-Tree spatial index, the thesis introduces a new force reinsert algorithm in order to optimize R*Tree spatial indexing structure. The experiment results show that improved R*-Tree is better performance than the original R*-Tree in index space utility, index dynamic construction and index retrieval.
Keywords
indexing; R*-Tree spatial index; forced reinsert algorithm; index dynamic construction; index retrieval; index space utility; multi-dimensional indexing structure; Algorithm design and analysis; Clustering algorithms; Educational institutions; Indexing; Information technology; Shape; Spatial databases; Spatial indexes; Tree data structures; Forced Reinsert; R*Tree; RTree; multi-dimensional indexing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology and Applications, 2009. IFITA '09. International Forum on
Conference_Location
Chengdu
Print_ISBN
978-0-7695-3600-2
Type
conf
DOI
10.1109/IFITA.2009.523
Filename
5231424
Link To Document