Concurrent search and insertion in K-Dimensional Height Balanced Trees

Author

Varshneya, A. ; Madan, B.B. ; Balakrishnan, M.

Author_Institution

Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Bombay, India

fYear

1994

fDate

26-29 Apr 1994

Firstpage

883

Lastpage

887

Abstract

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

Keywords

concurrency control; search problems; tree data structures; trees (mathematics); AVL trees; K-Dimensional Height Balanced Trees; balance factors; concurrency control; concurrent search; insert operations; kHB-trees; links; locks; root node; single dimensional AVL trees; Algorithm design and analysis; Binary search trees; Binary trees; Computer science; Concurrent computing; Data structures; Flexible structures; Multidimensional systems; Tree data structures;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1994. Proceedings., Eighth International

Conference_Location

Cancun

Print_ISBN

0-8186-5602-6

Type

conf

DOI

10.1109/IPPS.1994.288202

Filename

288202