Resumen
In this work, we propose ??3
D
3
-Tree, a dynamic distributed deterministic structure for data management in decentralized networks, by engineering and extending an existing decentralized structure. Conducting an extensive experimental study, 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 an ??(log??)
O
(
log
N
)
amortized bound (N is the number of nodes present in the network), using an efficient deterministic load-balancing mechanism, which is general enough to be applied to other hierarchical tree-based structures. Moreover, our structure achieves ??(log??)
O
(
log
N
)
worst-case search performance. Last but not least, 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 ??3
D
3
-Tree is highly fault-tolerant and achieves ??(log??)
O
(
log
N
)
amortized search cost under massive node failures, accompanied by a significant success rate. Afterwards, by incorporating this novel balancing scheme into the ART (Autonomous Range Tree) structure, we go one step further to achieve sub-logarithmic complexity and propose the ART+
+
structure. ART+
+
achieves an ??(log2??log??)
O
(
log
b
2
log
N
)
communication cost for query and update operations (b is a double-exponentially power of 2 and N is the total number of nodes). Moreover, ART+
+
is a fully dynamic and fault-tolerant structure, which supports the join/leave node operations in ??(loglog??)
O
(
log
log
N
)
expected WHP (with high proability) number of hops and performs load-balancing in ??(loglog??)
O
(
log
log
N
)
amortized cost.