Where should concurrent rotations take place to rebalance a distributed arbitrary search tree?
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 Sc...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1996 |
| 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/97310 |
| Acceso en línea: | https://hdl.handle.net/2117/97310 |
| Access Level: | acceso abierto |
| Palabra clave: | AVL trees Distributed systems Self-reorganization Concurrent rotations Àrees temàtiques de la UPC::Informàtica::Programació |
| Sumario: | 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. In particular, we show that our approach encapsulates a number of previous attempts described in the literature. 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? |
|---|