The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation

  • Authors:

  • Georgios Evangelidis;David Lomet;Betty Salzberg

  • Affiliations:

  • Informatics Dept., Technological Educational Institute of Thessaloniki, P.O. Box 14561, GR-54101 Thessaloniki, Greece;Microsoft Corporation, One Microsoft Way, Bldg 9, Redmond, WA 98052-6399, USA;College of Computer Science, Northeastern University, Boston, MA 02115, USA

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a new multi-attribute index. Our approach combines the hB-tree, a multi-attribute index, and the $\Pi$-tree, an abstract index which offers efficient concurrency and recovery methods. We call the resulting method the hB $^\Pi$-tree. We describe several versions of the hB $^\Pi$-tree, each using a different node-splitting and index-term-posting algorithm. We also describe a new node deletion algorithm. We have implemented all the versions of the hB $^\Pi$-tree. Our performance results show that even the version that offers no performance guarantees, actually performs very well in terms of storage utilization, index size (fan-out), exact-match and range searching, under various data types and distributions. We have also shown that our index is fairly insensitive to increases in dimension. Thus, it is suitable for indexing high-dimensional applications. This property and the fact that all our versions of the hB $^\Pi$-tree can use the $\Pi$-tree concurrency and recovery algorithms make the hB $^\Pi$-tree a promising candidate for inclusion in a general-purpose DBMS.