|
| 一种高效的空间索引结构 |
| An Efficient Spatial Index Structure |
| |
| DOI：10.3969/j.issn.1671-5322.2002.02.008 |
| 中文关键词: 空间数据 R树 最小边界矩形 索引 算法 |
| 英文关键词: Spatial data Rtree Index Algorithm Minimum bounding rectangle |
| 基金项目: |
|
| 摘要点击次数: 3535 |
| 全文下载次数: 3062 |
| 中文摘要: |
| 为高效地处理空间数据,必须对数据库建立索引机制以快速存取数据.然而,由于空间数据的特殊性使得传统索引方法不能很好地适应空间数据的存取.介绍了一种目前较流行的索引结构--R树及其主要算法.在所研究的空间分析数据库系统SADBS中实现了R树索引. |
| 英文摘要: |
| In order to handle spatial data efficiently, a database system needs an index mechanism that will help it retrieve data items quickly. However, traditional index methods are not well suited to access spatial data objects because of the special properties of spatial data. In this paper we introduce one of the most popular index structure Rtree and its major algorithms. We implement the R-tree indexing in SADBS which is a spatial analysis database system developed by us. |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |