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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Varshneya, A., Madan, B.B., Balakrishnan, M.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Binary search trees Binary trees Computer science Concurrent computing Data structures Flexible structures Multidimensional systems Tree data structures
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!