arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2312.15426cs.DS
收藏

二叉搜索树的组访问界

The Group Access Bounds for Binary Search Trees

Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai

AI总结:

本文提出组访问界,推广访问引理,证明模拟定理,为证明Splay树和Greedy的o(log n)竞争性提供新方向。

摘要:

访问引理(Sleator 和 Tarjan,JACM 1985)是二叉搜索树的一个性质,它蕴含了诸如静态最优性、静态手指和工作集性质等有趣的推论。然而,已知动态最优性的某些推论无法通过访问引理推导出来,例如动态手指,以及相对于最优 BST(其中 n 为键的数量)的任何 $o(\log n)$ 竞争比。在本文中,我们引入了组访问界,它可以相对于参考组访问树来定义。组访问界推广了访问引理,并蕴含了远比访问引理所蕴含的性质更强的性质。对于以下每个结果,都存在一棵组访问树,其组访问界:相对于最优 BST 具有 $O(\sqrt{\log n})$ 竞争比。当参考树是几乎完全二叉树时,实现 k-手指界,并带有 $O(m \log k \log \log n)$(随机化)的加性项。满足统一界,并带有 $O(m \log \log n)$ 的加性项。匹配带有时间窗口 k 的统一界,并带有 $O(m \log k \log \log n)$(随机化)的加性项。此外,我们证明了模拟定理:对于每棵组访问树,都存在一个在线 BST 算法,其与该组访问界具有 $O(1)$ 竞争比。特别是,任何新的组访问界将自动蕴含一个新的 BST 算法,实现相同的界。由此,我们获得了改进的 k-手指界(参考树为几乎完全二叉树),改进的带有时间窗口 k 的统一界,并在 BST 模型中匹配了统一界的最佳已知界。由于任何动态最优 BST 必须达到组访问界,我们相信我们的结果为证明 Splay 树和 Greedy 的 $o(\log n)$ 竞争性提供了新方向。

英文摘要:

The access lemma (Sleator and Tarjan, JACM 1985) is a property of binary search trees that implies interesting consequences such as static optimality, static finger, and working set property. However, there are known corollaries of the dynamic optimality that cannot be derived via the access lemma, such as the dynamic finger, and any $o(\log n)$-competitive ratio to the optimal BST where $n$ is the number of keys. In this paper, we introduce the group access bound that can be defined with respect to a reference group access tree. Group access bounds generalize the access lemma and imply properties that are far stronger than those implied by the access lemma. For each of the following results, there is a group access tree whose group access bound Is $O(\sqrt{\log n})$-competitive to the optimal BST. Achieves the $k$-finger bound with an additive term of $O(m \log k \log \log n)$ (randomized) when the reference tree is an almost complete binary tree. Satisfies the unified bound with an additive term of $O(m \log \log n)$. Matches the unified bound with a time window $k$ with an additive term of $O(m \log k \log \log n)$ (randomized). Furthermore, we prove simulation theorem: For every group access tree, there is an online BST algorithm that is $O(1)$-competitive with its group access bound. In particular, any new group access bound will automatically imply a new BST algorithm achieving the same bound. Thereby, we obtain an improved $k$-finger bound (reference tree is an almost complete binary tree), an improved unified bound with a time window $k$, and matching the best-known bound for Unified bound in the BST model. Since any dynamically optimal BST must achieve the group access bounds, we believe our results provide a new direction towards proving $o(\log n)$-competitiveness of Splay tree and Greedy.

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

↑