Self-Stabilizing Balancing Algorithm for Containment-Based Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Technical Report) Year : 2012

Self-Stabilizing Balancing Algorithm for Containment-Based Trees


Containment-based trees encompass various handy structures such as B+-trees, R-trees and M-trees. They are widely used to build data indexes, range-queryable overlays, publish/subscribe systems both in centralized and distributed contexts. In addition to their versatility, their balanced shape ensures an overall satisfactory performance. Re- cently, it has been shown that their distributed implementations can be fault-resilient. However, this robustness is achieved at the cost of un-balancing the structure. While the structure remains correct in terms of searchability, its performance can be significantly decreased. In this paper, we propose a distributed self-stabilizing algorithm to balance containment-based trees.
Fichier principal
Vignette du fichier
main.pdf (185.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00765005 , version 1 (13-12-2012)



Evangelos Bampas, Anissa Lamani, Franck Petit, Mathieu Valero. Self-Stabilizing Balancing Algorithm for Containment-Based Trees. [Technical Report] ???. 2012. ⟨hal-00765005⟩
259 View
231 Download



Gmail Facebook X LinkedIn More