计算机应用研究2016，Vol.33Issue(12)：3530-3534,5.DOI:10.3969/j.issn.1001-3695.2016.12.003
基于节点分裂优化的 R-树索引结构
R-tree index structure based on node splitting optimization
摘要
Abstract
Aiming at the problem of low spatial query efficiency in R-tree index,this paper presented SR-tree,an R-tree variant index structure that was based on node splitting optimization.During the process of node splitting,SR-tree improved spatial data aggregation of leaf nodes in order to reduce the overlapping area of minimum bounding rectangle (MBR)in leaf nodes.For the sake of decreasing disk input and output consumption,the nodes of SR-tree were written to the index as fol-lows.First,index tree was built in the memory beforehand.Second,the information of tree was written into files.At last,the nodes were written recursively into the tree.The experiments demonstrate that SR-tree can reduce MBR overlapping areas and can decrease query response time,which in turn achieves the purpose of improving query efficiency.关键词
R-树/查询效率/节点分裂/最小外接矩形/重叠面积Key words
R-tree/query efficiency/node splitting/minimum bounding rectangle (MBR)/overlapping area分类
信息技术与安全科学引用本文复制引用
徐明..基于节点分裂优化的 R-树索引结构[J].计算机应用研究,2016,33(12):3530-3534,5.基金项目
国家自然科学基金资助项目（61202370）；上海市教委科研创新资助项目（14YZ110）；中国博士后科学基金资助项目 （）
