arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1212.3418cs.DCcs.CC
收藏

基于包含树的自稳定平衡算法

Self-Stabilizing Balancing Algorithm for Containment-Based Trees

Evangelos Bampas, Anissa Lamani, Franck Petit, Mathieu Valero

摘要:

基于容器的树包含各种方便的结构,如B+树,R树和M树。它们被广泛用于在集中式和分布式环境中构建数据索引、范围可查询覆盖、发布/订阅系统。除了它们的多功能性外,它们平衡的形状确保了令人满意的整体性能。最近,它已被证明,他们的分布式实现可以故障恢复。然而,这种鲁棒性是以不平衡结构为代价的。虽然结构在可搜索性方面保持正确,但其性能可能会显着降低。在本文中,我们提出了一个分布式的自稳定算法来平衡基于包含的树。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑