指标集的新方法
Finger Indexed Sets: New Approaches
摘要：
在特定情况下，我们在给定的$n$一维元素集合S的尾部有插入/删除，我们提出了一个比[Anderson，2007]中提出的算法更简单和更具体的算法，实现了手指搜索查询的$O(\sqrt{logd/loglogd})$的相同（但也是分期付款的）上限，其中$d$是手指元素和我们正在寻找的目标元素之间的排序键的数量。此外，在一般情况下，我们有插入/删除任何地方，我们提出了一个新的随机算法实现相同的预期时间范围。即使新的解决方案达到最优的边界在摊销或预期的情况下，简单的优点是非常重要的，由于我们获得的实际优点。
英文摘要：
In the particular case we have insertions/deletions at the tail of a given set S of $n$ one-dimensional elements, we present a simpler and more concrete algorithm than that presented in [Anderson, 2007] achieving the same (but also amortized) upper bound of $O(\sqrt{logd/loglogd})$ for finger searching queries, where $d$ is the number of sorted keys between the finger element and the target element we are looking for. Furthermore, in general case we have insertions/deletions anywhere we present a new randomized algorithm achieving the same expected time bounds. Even the new solutions achieve the optimal bounds in amortized or expected case, the advantage of simplicity is of great importance due to practical merits we gain.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
