空间数据库中的一种混合索引结构的研究  

Research on hybrid index structure in spatial database

作　　者：杨泽雪[1] YANG Zexue(Department of Computer Science and Technology, Heilongjiang Institute of Technology, Harbin 150050, China)

机构地区：[1]黑龙江工程学院计算机科学与技术系,哈尔滨150050

出　　处：《计算机工程与应用》2017年第20期20-23,165,共5页Computer Engineering and Applications

基　　金：黑龙江工程学院博士基金(No.2014BJ09);河南省高等学校重点科研项目(No.18A520023)

摘　　要：空间索引是实现空间查询的关键技术,其性能的好坏直接决定着空间数据的存储效率及空间查询的性能。为了提高空间查询效率,提出一种混合空间索引结构松散QR-树:LQR-tree。针对已有的QR-树索引结构在节点分配中,可能存在较小的对象落入较大的节点中的问题,将松散四叉树和R-树相结合,能够实现节点下移,优化处理移动空间对象的查询,给出LQR-tree的结构和插入删除算法,并提出对应算法的相关定理和证明。Spatial index is the key technology to realize spatial query,and its performance decides the storage efficiencyof spatial data and the performance of spatial query directly.In order to improve spatial query efficiency,a hybrid spatialindex structure called LQR-tree is proposed.For the existing QR-tree index structure,there may be a problem that smallerobjects fall into larger nodes in the allocation of nodes.The structure will combine loose quardtree and R-tree and canmove nodes from the upper level to the lower level.The index can optimize query performance of moving spatial objects.In this paper,the structure of LQR-tree is given and insert and delete algorithm are put forward.And relevant theoremsand proofs are given.

关 键 词：空间索引 空间数据库 空间查询 R-树 松散四叉树 

分 类 号：TP311.131[自动化与计算机技术—计算机软件与理论]