Self-Stabilizing Balancing Algorithm for Containment-Based Trees
type: Dataset
description: 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.
issued: 2026-05-31T05:28:19.699180
language: en
modified: 2026-05-31T05:28:19.699186
contact point: Organization
  fn: CCSD
keyword: balancing-algorithms
keyword: containment-based-trees
keyword: infoeu-reposemanticsreport
keyword: infoinfo-cccomputer-science-cscomputational-complexity-cscc
keyword: infoinfo-dccomputer-science-csdistributed-parallel-and-cluster-computing-csdc
keyword: reports
keyword: self-stabilization
landing page: https://inria.hal.science/hal-00765005

Self-Stabilizing Balancing Algorithm for Containment-Based Trees
type: Distribution
format: HTML
issued: 2026-05-31T05:28:19.756369
modified: 2026-05-31T05:28:19.673267
access URL: https://inria.hal.science/hal-00765005

test_moissonnage_selune
type: Agent