Please use this identifier to cite or link to this item:
https://ruomo.lib.uom.gr/handle/7000/1248
Title: | The hBP-tree - A Modified hB-tree Supporting Concurrency, Recoveryand Node Consolidation |
Authors: | Evangelidis, Georgios Lomet, David B. Salzberg, Betty |
Type: | Conference Paper |
Subjects: | FRASCATI::Natural sciences::Computer and information sciences |
Keywords: | indexing B-trees multi-attribute access methods spatial access methods concurrency recovery |
Issue Date: | 1995 |
First Page: | 551 |
Last Page: | 561 |
Volume Title: | VLDB'95, Proceedings of 21th International Conference on Very LargeData Bases, September 11-15, 1995, Zurich, Switzerland |
Abstract: | We describe a new access method, the hB\Pi-tree, an adaptation of the hB-tree index to the constraints of the Pi-tree. The Pi-trees, a generalization of the B link-trees, provide high concurrency with recovery, because they break down structure modification into a series of short atomic actions. In addition, the IItrees include a node consolidation algorithm. The hB-tree is, a multi-attribute index which is highly insensitive to dimensionality, but which has no node consolidation algorithm and has a flaw in its split/post algorithm in certain special cases. The hB\Pi-tree corrects the splitting/posting algorithm and adapts the concurrency, recovery and node consolidation of the Pi-tree to the hB-tree. The combination makes the hB\Pi-tree suitable for inclusion in a general purpose database management system.supporting multi-attribute and spatial queries. |
URI: | http://www.vldb.org/conf/1995/P551.PDF https://ruomo.lib.uom.gr/handle/7000/1248 |
Appears in Collections: | Department of Applied Informatics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1995_vldb_openaccess.pdf | 1,16 MB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License