The hB*-Tree——an Improved Multidimensional Indexing Method of hB-Tree
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

金树东,冯玉才,孙小薇.多维索引hB树的改进方法——hB*树.软件学报,1998,9(3):206-212

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 17,1996
  • Revised:April 28,1997
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063