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.