Concurrent search and insertion in K-Dimensional Height Balanced Trees

An algorithm is proposed that enables a number of concurrent search and insert operations to be performed on K-Dimensional Height Balanced Trees (kHB-trees) (V.K. Vaishnavi, 1984). The algorithm proposed by C.S. Ellis (1980) for AVL trees is not applicable for kHB-trees because of the difference in types of rotations and the way the balance factors are updated in kHB-trees. For rebalancing, the kHB-tree needs to be traversed from the leaf towards the root node, making Ellis's algorithm inapplicable. By introducing locks on links and avoiding work which may need to be undone, the proposed algorithm allows greater concurrency than the previously proposed algorithms even for single dimensional AVL trees.< >