计算机应用 ›› 2010, Vol. 30 ›› Issue (4): 1103-1106.

• 数据库与数据挖掘 • 上一篇    下一篇

基于RBD-tree的空间索引结构设计

马绚   

  1. 华东政法大学
  • 收稿日期:2009-10-25 修回日期:2009-11-29 发布日期:2010-04-15 出版日期:2010-04-01
  • 通讯作者: 马绚

Design of spatial index structure based on RBD-tree

  • Received:2009-10-25 Revised:2009-11-29 Online:2010-04-15 Published:2010-04-01

摘要: 在Ro-tree索引结构的基础上提出了一种新的变种RBD-tree索引结构。RBD-tree是一种基于节点密度的索引结构,以节点密度来衡量节点的性质,其核心思想是将密度相近的点组织在一起,实际上,这些密度相近的节点往往在物理上也是相近的,因此有效提高了查询效率,而且对索引结构的优化是独立于存储设备的。

关键词: 地理信息系统, 空间索引, Ro树, RBD树

Abstract: RBD-tree, a new variant index structure, derived from Ro-tree was introduced in this paper. RBD-tree is an index structure based on node density which is important to measure the node quality. The core idea of RBD-tree is to organize the nodes with similar features together. In reality, the nodes with similar features are often adjacent with each other. Therefore, RBD-tree greatly improves the spatial query efficiency, and optimization of the index structure is independent of storage devices.

Key words: Geographic Information System (GIS), spatial index, Ro-tree, RBD-tree