带移位的可合并字典
Mergeable Dictionaries With Shifts
摘要:
我们重新审视可合并的字典与移位问题,其目标是保持一个家庭的集合进行搜索,分裂,合并,使集,和移位操作。搜索、分裂和生成集操作是通常熟知的教科书操作。合并操作合并两个集合,移位操作从集合中的所有元素中添加或减去一个整数。注意,与标准平衡搜索树结构(诸如AVL树或2-4树)上的连接操作不同,合并操作对输入集合的键空间没有限制,并且支持合并任意交织的集合。这个问题是搜索Lempel-Ziv压缩文本,可合并树问题和联合分裂查找问题的关键组成部分。我们提出了第一个解决方案,实现了所有操作的O(log U)摊销时间,其中{1,2,.,U}是集合的论域。这个界限是最佳的,当宇宙的大小是多项式的集合的大小之和的限制。我们的解决方案是简单的,基于一种新的扩展偏置搜索树。
英文摘要:
We revisit the mergeable dictionaries with shift problem, where the goal is to maintain a family of sets subject to search, split, merge, make-set, and shift operations. The search, split, and make-set operations are the usual well-known textbook operations. The merge operation merges two sets and the shift operation adds or subtracts an integer from all elements in a set. Note that unlike the join operation on standard balanced search tree structures, such as AVL trees or 2-4 trees, the merge operation has no restriction on the key space of the input sets and supports merging arbitrarily interleaved sets. This problem is a key component in searching Lempel-Ziv compressed texts, in the mergeable trees problem, and in the union-split-find problem. We present the first solution achieving O(log U) amortized time for all operations, where {1, 2, ..., U} is the universe of the sets. This bound is optimal when the size of the universe is polynomially bounded by the sum of the sizes of the sets. Our solution is simple and based on a novel extension of biased search trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。