分层工作集树
Layered Working-Set Trees
摘要：
工作集界限[Sleator and Tarjan，J. ACM，1985]粗略地指出，如果元素最近被访问过，则搜索该元素的速度很快。二叉搜索树，例如splay树，可以在摊销意义上实现此属性，而已知不是二叉搜索树的数据结构在最坏情况下具有此属性。我们关闭这个差距，并提出了一个二叉搜索树称为分层工作集树，保证在最坏的情况下的工作集属性。统一边界[Badoiu等人，TCS，2007]粗略地说，如果一个元素靠近（就秩距离而言）最近访问的元素，则搜索该元素是快速的。我们展示了如何分层的工作集树可以用来实现统一的绑定到一个小的加法项在摊销的意义上，同时保持在最坏的情况下的访问时间是对数和一个小的乘法因子的工作集的范围内。
英文摘要：
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as splay trees, can achieve this property in the amortized sense, while data structures that are not binary search trees are known to have this property in the worst case. We close this gap and present a binary search tree called a layered working-set tree that guarantees the working-set property in the worst case. The unified bound [Badoiu et al., TCS, 2007] roughly states that searching for an element is fast if it is near (in terms of rank distance) to a recently accessed element. We show how layered working-set trees can be used to achieve the unified bound to within a small additive term in the amortized sense while maintaining in the worst case an access time that is both logarithmic and within a small multiplicative factor of the working-set bound.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
