Concurrent AVL Revisited: Self-Balancing Distributed Search Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

Concurrent AVL Revisited: Self-Balancing Distributed Search Trees

Abstract

We address the concurrent insertion and deletion of keys in binary almost balanced search trees (AVL trees). We show that this problem can be studied through the self-reorganization of distributed systems of processes controlled by local evolution rules in the line of the approach of Dijkstra and Scholten. This yields a simple and abstract presentation of the insertion and deletion mechanisms. In particular, we show that our approach encapsulates a number of previous attempts described in the literature. They can in fact be seen as ad hoc specializations of the nondeterministic evolution rules. This solves in a very general setting an old question raised by H.T. Kung and P.L. Lehman: where should rotations take place to rebalance arbitrary trees?
Fichier principal
Vignette du fichier
RR-2761.pdf (373.99 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00073931 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073931 , version 1

Cite

Luc Bougé, Joachim Gabarrò, Xavier Messeguer. Concurrent AVL Revisited: Self-Balancing Distributed Search Trees. [Research Report] RR-2761, INRIA. 1995. ⟨inria-00073931⟩
136 View
426 Download

Share

Gmail Facebook Twitter LinkedIn More