| 摘要: |
| 本文在hB树基础上提出多属性索引方法——hB*树.hB*树索引结点溢出时先寻求避免分裂,以期得到较好的空间利用率;通过避免和消除多父结点,使hB*树成为严格的树形结构.本文表明hB*树提高了空间利用率,树形化的代价也不高. |
| 关键词: 存取方法,多维索引,B树,hB树,空间利用率. |
| DOI： |
| 分类号: |
| 基金项目: |
|
| The hB*-Tree——an Improved Multidimensional Indexing Method of hB-Tree |
|
JIN Shu-dong,JIN Shu-dong,SUN Xiao-wei
|
| Abstract: |
| This paper is proposed a new multiattribute index method named hB*-tree on the basis of hB-tree. When an index node overflows, the first step is to avoid splitting if splitting will lead to poor balance degree. Therefore the node utilization of hB*-tree is improved. The DAG problem of hB-tree is also reduced by careful selection of extracted k-d-subtree. If a splitting still produces DAG structure, the hB*-tree is reorganized to be a strict tree. The authors show that hB*-tree has reasonable space utilization and access costs. |
| Key words: Access methods, multidimensional index, B-tree, hB-tree, space utilization |
