Please use this identifier to cite or link to this item:
Title: The hB^Pi -tree: a multi-attribute index supporting concurrency, recovery and node consolidation
Authors: Evangelidis, Georgios
Lomet, David B.
Salzberg, Betty
Type: Article
Subjects: FRASCATI::Natural sciences::Computer and information sciences
Keywords: Multi-attribute index
Node consolidation
Issue Date: 1997
Source: The VLDB Journal The International Journal on Very Large Data Bases
Volume: 6
Issue: 1
First Page: 1
Last Page: 25
Abstract: We propose a new multi-attribute index. Our approach combines the hB-tree, a multi-attribute index, and the Π-tree, an abstract index which offers efficient concurrency and recovery methods. We call the resulting method the hBΠ-tree. We describe several versions of the hBΠ-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Π-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Π-tree can use the Π-tree concurrency and recovery algorithms make the hBΠ-tree a promising candidate for inclusion in a general-purpose DBMS.
ISSN: 1066-8888
Other Identifiers: 10.1007/s007780050030
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
1997_vldbj.pdf251,95 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons