%0 Journal Article
%T The hB*-Tree--an Improved Multidimensional Indexing Method of hB-Tree<br>多维索引hB树的改进方法--hB*树
%A JIN Shu-dong
%A JIN Shu-dong
%A SUN Xiao-wei
%A <br>金树东
%A 冯玉才
%A 孙小薇
%J 软件学报
%D 1998
%I 
%X 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.
%K Access methods
%K multidimensional index
%K B-tree
%K hB-tree
%K space utilization<br>存取方法
%K 多维索引
%K B树
%K hB树
%K 空间利用率.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=D17B59D20DBA8E8F6AD973692F854595&yid=8CAA3A429E3EA654&vid=9CF7A0430CBB2DFD&iid=38B194292C032A66&sid=9F6DA927E843CD50&eid=D2742EEE6F4DF8FE&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=11