arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.07760cs.DS
收藏

单调最小完美哈希的简化紧界

Simplified Tight Bounds for Monotone Minimal Perfect Hashing

Dmitry Kosolobov

AI总结:

本文针对单调最小完美哈希(MMPHF)的空间复杂度,在更宽泛的参数范围内证明了紧下界,并简化了先前证明,几乎完全解决了该问题。

摘要:

给定来自全集 $\{0,\ldots,u-1\}$ 的递增整数序列 $x_1,\ldots,x_n$,该序列的单调最小完美哈希函数(MMPHF)是一种数据结构,用于回答以下排名查询:若 $x = x_i$($i\in \{1,\ldots,n\}$),则 $rank(x) = i$;否则 $rank(x)$ 为任意值。Assadi、Farach-Colton 和 Kuszmaul 最近在 SODA'23 上给出了 MMPHF 所需空间位数的下界 $\Omega(n \min\{\log\log\log u, \log n\})$ 的证明,前提是 $u \ge n 2^{2^{\sqrt{\log\log n}}}$,该下界是紧的,因为存在一种 MMPHF 数据结构能达到此空间界(并以 $O(\log u)$ 时间回答查询)。在本文中,我们通过证明对于 $u \ge (1+\epsilon)n$(其中 $\epsilon > 0$ 为任意常数),紧下界为 $\Omega(n \min\{\log\log\log \frac{u}{n}, \log n\})$(该下界同样可达),填补了剩余空白;我们观察到,对于所有合理情况,当 $n < u < (1+\epsilon)n$ 时,已知事实蕴含紧界,这实际上解决了该问题。在此过程中,我们大幅简化了 Assadi 等人的证明,用平凡的观察替换了他们部分繁重的组合机制。然而,证明的一个重要部分仍然复杂。本文的这一部分重复了 Assadi 等人的论证,并非新颖。尽管如此,为了完整性,我们将其包含在内,并对这些论证提供了略有不同的视角。

英文摘要:

Given an increasing sequence of integers $x_1,\ldots,x_n$ from a universe $\{0,\ldots,u-1\}$, the monotone minimal perfect hash function (MMPHF) for this sequence is a data structure that answers the following rank queries: $rank(x) = i$ if $x = x_i$, for $i\in \{1,\ldots,n\}$, and $rank(x)$ is arbitrary otherwise. Assadi, Farach-Colton, and Kuszmaul recently presented at SODA'23 a proof of the lower bound $Ω(n \min\{\log\log\log u, \log n\})$ for the bits of space required by MMPHF, provided $u \ge n 2^{2^{\sqrt{\log\log n}}}$, which is tight since there is a data structure for MMPHF that attains this space bound (and answers the queries in $O(\log u)$ time). In this paper, we close the remaining gap by proving that, for $u \ge (1+ε)n$, where $ε> 0$ is any constant, the tight lower bound is $Ω(n \min\{\log\log\log \frac{u}{n}, \log n\})$, which is also attainable; we observe that, for all reasonable cases when $n < u < (1+ε)n$, known facts imply tight bounds, which virtually settles the problem. Along the way we substantially simplify the proof of Assadi et al. replacing a part of their heavy combinatorial machinery by trivial observations. However, an important part of the proof still remains complicated. This part of our paper repeats arguments of Assadi et al. and is not novel. Nevertheless, we include it, for completeness, offering a somewhat different perspective on these arguments.

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

↑