D3-Tree：一种分布式树结构的动态确定性负载均衡器
D3-Tree: A Dynamic Distributed Deterministic Load - Balancer for decentralized tree structures
摘要：
在这项工作中，我们提出了D3树，一个动态的分布式确定性结构的数据管理在分散的网络。我们提出了简要的理论算法分析，我们提出的结构是基于，我们彻底描述的关键方面的实施。进行实验，我们验证了实现的结构优于其他知名的层次树为基础的结构，因为它提供了更好的负载平衡操作的复杂性。更具体地说，该结构实现了一个对数摊销的界限，使用一个有效的确定性负载平衡机制，这是一般的，足以适用于其他层次树为基础的结构。此外，我们调查的结构的容错，这还没有得到充分的解决，在以前的工作中，无论是理论上和通过严格的实验。我们证明了D3树是高度容错的，因为，即使是大规模的节点故障，它实现了显着的元素查询的成功率。然后，我们更进一步，为了达到亚对数复杂度，并提出了ART+结构（自治范围树），利用D3树的优异性能。ART+是一个完全动态的容错结构，它实现了查询和更新操作的亚对数性能，并在亚对数摊销成本下执行负载平衡。
英文摘要：
In this work, we propose D3-Tree, a dynamic distributed deterministic structure for data management in decentralized networks. We present in brief the theoretical algorithmic analysis, in which our proposed structure is based on, and we describe thoroughly the key aspects of the implementation. Conducting experiments, we verify that the implemented structure outperforms other well-known hierarchical tree-based structures, since it provides better complexities regarding load-balancing operations. More specifically, the structure achieves a logarithmic amortized bound, using an efficient deterministic load-balancing mechanism, which is general enough to be applied to other hierarchical tree-based structures. Moreover, we investigate the structure's fault tolerance, which hasn't been sufficiently tackled in previous work, both theoretically and through rigorous experimentation. We prove that D3-Tree is highly fault tolerant, since, even for massive node failures, it achieves a significant success rate in element queries. Afterwards we go one step further, in order to achieve sub-logarithmic complexity and propose the ART+ structure (Autonomous Range Tree), exploiting the excellent performance of D3-Tree. ART+ is a fully dynamic and fault-tolerant structure, which achieves sub-logarithmic performance for query and update operations and performs load-balancing in sub-logarithmic amortized cost.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
