利用HB+树的复合索引问题的解决方案

Solution of Composite Index Problem by HB+ Tree

B+树是目前数据库管理系统在单属性上广泛使用的一种索引,但它在处理由多属性组成的复合索引时效率很低。为此,该文在B+树的基础上提出了一种考虑属性逻辑层次关系的HB+树及其操作算法。该树采用了分类串行解析各属性的方法,可以很好地解决复合索引问题;并具有层次分类清楚、结点小且结构简单等优点。文中还对HB+树的时空性能进行了分析。

B＋ tree has been widely used as single-attribute index in DBMS： But it can＇t do well with complex index. So this paper proposes HB＋ tree based on B＋ tree. which can effectively resolve the above problem for its special attribute-logic-floor relationship; and all basic algorithms are given and time-space performance is analysed.