Title :
A new solution of node splitting to the R Tree algorithm
Author :
Wang, Liang ; Yu, Songnian ; Chen, Feng
Author_Institution :
Sch. of Comput. Eng. & Sci., Shanghai Univ., Shanghai, China
Abstract :
This paper aims to present a new solution about node splitting to overcome the disadvantage which Guttman described in his paper. By comparing with the node splitting algorithm which tries to solve the “remaining entries” problem and the general node splitting algorithm which requires quadratic time, the result of this study indicates that multipath query has decreased and the performance of spatial query has improved effectively due to smaller overlap was brought.
Keywords :
algorithm theory; query processing; trees (mathematics); R tree algorithm; multipath query; node splitting algorithm; spatial query; Algorithm design and analysis; Clustering algorithms; Computers; Indexing; Partitioning algorithms; Spatial databases;
Conference_Titel :
Intelligent Control and Information Processing (ICICIP), 2010 International Conference on
Conference_Location :
Dalian
Print_ISBN :
978-1-4244-7047-1
DOI :
10.1109/ICICIP.2010.5564214
