首页 | 官方网站   微博 | 高级检索  
     

多维索引hB树的改进方法——hB*
引用本文:金树东,冯玉才,孙小薇.多维索引hB树的改进方法——hB*树[J].软件学报,1998,9(3):206-212.
作者姓名:金树东  冯玉才  孙小薇
作者单位:华中理工大学计算机科学与工程系,武汉,430074
摘    要:本文在hB树基础上提出多属性索引方法——hB*树.hB*树索引结点溢出时先寻求避免分裂,以期得到较好的空间利用率;通过避免和消除多父结点,使hB*树成为严格的树形结构.本文表明hB*树提高了空间利用率,树形化的代价也不高.

关 键 词:存取方法  多维索引  B树  hB树  空间利用率.
收稿时间:1996/12/17 0:00:00
修稿时间:1997/4/28 0:00:00

The hB*-Tree--an Improved Multidimensional Indexing Method of hB-Tree
JIN Shu-dong,JIN Shu-dong and SUN Xiao-wei.The hB*-Tree--an Improved Multidimensional Indexing Method of hB-Tree[J].Journal of Software,1998,9(3):206-212.
Authors:JIN Shu-dong  JIN Shu-dong and SUN Xiao-wei
Affiliation:Department of Computer Science and Engineering\ Huazhong University of Science and Technology\ Wuhan\ 430074
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.
Keywords:Access methods  multidimensional index  B-tree  hB-tree  space utilization
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号