QR-树:一种基于R-树与四叉树的空间索引结构  

QR-tree:a Kind of Spatial Index Structure Based on R-tree and Quad-tree

作　　者：张芩[1] 王振民 

机构地区：[1]华南理工大学计算机科学与工程学院,广州510640 [2]深圳市华正联实业有限公司,深圳518049

出　　处：《计算机工程与应用》2004年第9期100-103,共4页Computer Engineering and Applications

摘　　要：提出了一种基于R-树与“四叉树”空间层次划分的空间索引结构QR-树,给出了其数据结构和算法描述。实验证明:与R-树相比,QR-树以略大(有时甚至略小)的空间开销代价,换取了更高的性能,且索引目标数越多,QR-树的整体性能越好。QR-tree,a spatial index structure based on R-tree and a kind of space partition method using Quad-tree,is proposed.Its data structure and algorithms are also stated.Our experiments show that QR-tree consumes a litle more(sometimes less)storage than R-tree.In return,QR-tree gains much higher performance.Furthermore,the more the number of spatial objects indexed are,the better the overall performance of QR-tree is.

关 键 词：空间索引 空间数据库 R-树 QR-树 

分 类 号：TP392[自动化与计算机技术—计算机应用技术]