| QR-树:一种基于R-树与四叉树的空间索引结构 |
| |
| 引用本文： | 张芩,王振民. QR-树:一种基于R-树与四叉树的空间索引结构[J]. 计算机工程与应用, 2004, 40(9): 100-103 |
| |
| 作者姓名： | 张芩 王振民 |
| |
| 作者单位： | 华南理工大学计算机科学与工程学院,广州,510640;深圳市华正联实业有限公司,深圳,518049 |
| |
| 摘 要： | 提出了一种基于R-树与“四叉树”空间层次划分的空间索引结构QR-树,给出了其数据结构和算法描述。实验证明:与R-树相比,QR-树以略大(有时甚至略小)的空间开销代价,换取了更高的性能,且索引目标数越多,QR-树的整体性能越好。
|
| 关 键 词： | 空间索引 空间数据库 R-树 QR-树 |
| 文章编号： | 1002-8331-(2004)09-0100-04 |
QR-tree:a Kind of Spatial Index Structure Based on R-tree and Quad-tree |
| |
| Zhang Qin Wang Zhenmin. QR-tree:a Kind of Spatial Index Structure Based on R-tree and Quad-tree[J]. Computer Engineering and Applications, 2004, 40(9): 100-103 |
| |
| Authors: | Zhang Qin Wang Zhenmin |
| |
| Affiliation: | Zhang Qin 1 Wang Zhenmin 21 |
| |
| Abstract: | 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. |
| |
| Keywords: | Spatial indexing Spatial database R-tree QR-tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
