HCB-tree: a height compressed B-tree for parallel processing (Q1116322)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: HCB-tree: a height compressed B-tree for parallel processing |
scientific article; zbMATH DE number 4088905
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | HCB-tree: a height compressed B-tree for parallel processing |
scientific article; zbMATH DE number 4088905 |
Statements
HCB-tree: a height compressed B-tree for parallel processing (English)
0 references
1988
0 references
B-tree type indexes are popular in database applications because they provide a fast access path to large databases. In this paper a new storage structure is presented which is suitable for fast parallel searching by using B-tree like indexes. The modified B-tree structure is called the height compressed B-tree (HCB-tree). The main results presented in this paper are that parallel processing of HCB-trees reduces access time and minimizes the frequency of restructuring considerably.
0 references
synchronized disk
0 references
queueing model
0 references
databases
0 references
storage structure
0 references
parallel searching
0 references
B-tree
0 references
parallel processing
0 references
