使用哈希来解决字典问题（在外部存储器中）
Using Hashing to Solve the Dictionary Problem (In External Memory)
摘要：
我们考虑了外部存储器中的字典问题，并将众所周知的缓冲树的更新时间提高了大约一个对数因子。对于任意λ>= max {lg lg n，log_{M/B}（n/B）}，我们可以支持时间复杂度为O（λ/ B）的更新和时间复杂度为O（log_λn）的查询。我们还提出了一个下限的细胞探针模型表明，我们的数据结构是最佳的。在RAM中，半个多世纪以来，哈希表一直被用来比二分查找更快地解决字典问题。相比之下，我们的数据结构是第一个在外部存储器中克服比较障碍的结构。我们的也是第一个令人信服地脱离不可分割性范式的数据结构。
英文摘要：
We consider the dictionary problem in external memory and improve the update time of the well-known buffer tree by roughly a logarithmic factor. For any λ>= max {lg lg n, log_{M/B} (n/B)}, we can support updates in time O(λ/ B) and queries in sublogarithmic time, O(log_λn). We also present a lower bound in the cell-probe model showing that our data structure is optimal. In the RAM, hash tables have been used to solve the dictionary problem faster than binary search for more than half a century. By contrast, our data structure is the first to beat the comparison barrier in external memory. Ours is also the first data structure to depart convincingly from the indivisibility paradigm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
