HCB-tree: a height compressed B-tree for parallel processing (Q1116322)

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.