B-松弛树:空间高效的B-树
B-slack trees: Highly Space Efficient B-trees
摘要:
B-松弛树,一个子类的B-树,有实质上更好的最坏情况下的空间复杂度,介绍。它们将$n$键存储在高度$O(\log_b n)$中,其中$b$是最大节点度。更新可以在$O(\log_{\frac b 2} n)$分摊时间内执行。一个宽松的平衡版本,这是非常适合并发实现,也提出了。
英文摘要:
B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store $n$ keys in height $O(\log_b n)$, where $b$ is the maximum node degree. Updates can be performed in $O(\log_{\frac b 2} n)$ amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。