Concurrent rebalancing of AVL trees: a fine-grained approach
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a rebalancing may for instance be necessary after successive insertions and deletions of keys. We show that this problem can be studied through the self-reorganization of distributed systems of nodes contr...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1997 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/96540 |
| Acceso en línea: | https://hdl.handle.net/2117/96540 |
| Access Level: | acceso abierto |
| Palabra clave: | Concurrent rebalancing AVL trees Concurrent algorithms Concurrent insertions and deletions Concurrent generalized rotations Safety and liveness proofs Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a rebalancing may for instance be necessary after successive insertions and deletions of keys. We show that this problem can be studied through the self-reorganization of distributed systems of nodes controlled by local evolution rules in the line of the approach of Dijkstra and Scholten. This yields a much simpler algorithm that the ones previously known. As a by-product, 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 search trees? |
|---|