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

具有指数搜索树的动态序集

Dynamic Ordered Sets with Exponential Search Trees

Arne Andersson, Mikkel Thorup

摘要:

我们引入指数搜索树作为一种新的技术,用于将有序集的静态多项式空间搜索结构转换为全动态线性空间数据结构。这导致在线性空间中搜索和更新n个整数键的动态集合的最佳界为O(sqrt(log n/loglog n))。这里搜索整数y意味着找到集合中小于或等于y的最大键。这个问题等价于维护有序集的标准教科书问题(参见,例如,Cormen,Leiserson,Rivest,and Stein:Introduction to Algorithms,2nd ed. MIT Press,2001)。之前最好的确定性线性空间边界是O(log n/loglog n),这是由Fredman和Willard在1990年的STOC中提出的。使用多项式空间没有更好的确定性搜索界限。我们还得到了数字n、字长w和最大密钥U < 2^w之间的最坏情况线性空间权衡:O(min{loglog n+log n/log w,(loglog n)(loglog U)/(logloglog U)})。然而,这些权衡不太可能是最佳的。我们的结果被推广到手指搜索和字符串搜索,提供最佳的结果,无论是在n。

英文摘要:

We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structures. This leads to an optimal bound of O(sqrt(log n/loglog n)) for searching and updating a dynamic set of n integer keys in linear space. Here searching an integer y means finding the maximum key in the set which is smaller than or equal to y. This problem is equivalent to the standard text book problem of maintaining an ordered set (see, e.g., Cormen, Leiserson, Rivest, and Stein: Introduction to Algorithms, 2nd ed., MIT Press, 2001). The best previous deterministic linear space bound was O(log n/loglog n) due Fredman and Willard from STOC 1990. No better deterministic search bound was known using polynomial space. We also get the following worst-case linear space trade-offs between the number n, the word length w, and the maximal key U < 2^w: O(min{loglog n+log n/log w, (loglog n)(loglog U)/(logloglog U)}). These trade-offs are, however, not likely to be optimal. Our results are generalized to finger searching and string searching, providing optimal results for both in terms of n.

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

↑