增量与动态检索的紧界与相变
Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
AI总结:
本文研究多项式论域下的增量与动态键值检索,证明两类设置的最优空间界,并揭示增量设置在 v 趋近 log n 时从 n log log n 降至 Θ(n) 的相变。
摘要:
检索数据结构是指在回答键-值查询时无需承担显式存储键所带来的空间开销的数据结构。该问题可表述为四种设置(静态、值动态、增量或动态),每一种都为用户提供不同程度的动态性。本文在多项式论域情形下,为最后两种设置(增量和动态)建立了最优界。我们的结果完善了一条跨越二十余年的研究脉络,并带来一个意外发现:长期以来被认为与动态设置本质等价的增量设置实际上存在相变;随着值大小 v 趋近 log n,最优空间冗余实际上开始收缩,从约 n log log n(长期以来被认为是最优的)一路降至 Θ(n)(即使对于看似容易得多的值动态设置,这也是最优界)。
英文摘要:
Retrieval data structures are data structures that answer key-value queries without paying the space overhead of explicitly storing keys. The problem can be formulated in four settings (static, value-dynamic, incremental, or dynamic), each of which offers different levels of dynamism to the user. In this paper, we establish optimal bounds for the final two settings (incremental and dynamic) in the case of a polynomial universe. Our results complete a line of work that has spanned more than two decades, and also come with a surprise: the incremental setting, which has long been viewed as essentially equivalent to the dynamic one, actually has a phase transition, in which, as the value size $v$ approaches $\log n$, the optimal space redundancy actually begins to shrink, going from roughly $n \log \log n$ (which has long been thought to be optimal) all the way down to $Θ(n)$ (which is the optimal bound even for the seemingly much-easier value-dynamic setting).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。