Paper
25 July 2007 A brand-new node-choosing algorithm in R-tree spatial index
Jun Gong, Shengnan Ke, Shuming Bao
Author Affiliations +
Abstract
Spatial index is one of the key techniques in the field of spatial database. This paper presents a brand-new node-choosing algorithm in the insertion procedure of R-tree spatial index, which is very different from the current algorithms. From the beginning of the leaf-node layer, firstly from bottom to top then inversely, the proper leaf-node is chosen, and this scheme can solve the problems caused by node overlapping. Meantime, the concept of Rtree_Cauchy is firstly put forward, and the sum of overlay, overlap and Rtree_Cauchy is introduced as selection criterion to guarantee that shape of node is average and avoid generating long-strip-shape nodes. A comparative performance analysis on the current and improved methods shows that not only the query performance but also the generation performance of the improved method is higher than the current methods such as R*-tree.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jun Gong, Shengnan Ke, and Shuming Bao "A brand-new node-choosing algorithm in R-tree spatial index", Proc. SPIE 6753, Geoinformatics 2007: Geospatial Information Science, 675307 (25 July 2007); https://doi.org/10.1117/12.760460
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Databases

Evolutionary algorithms

Algorithm development

Data modeling

Algorithms

Computer networks

Detection and tracking algorithms

Back to Top