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

C-理想哈希的边界

Bounds for c-Ideal Hashing

Fabian Frei, David Wehner

摘要:

在本文中,我们从最坏情况的角度来分析哈希。为此,我们研究了哈希族的一个新的属性,它与d-完美哈希密切相关,即c-理想性。一方面,这个概念概括了完美散列的定义,这已经被广泛研究;另一方面,它提供了一个直接的链接到c-近似性的概念。我们重点讨论了通常被忽略的平均负载α至少为1的情况,并证明了c-理想哈希族的最小大小的参数化上界和下界。顺便说一下,我们展示了c-ideality如何帮助分析哈希的建议复杂性。十年前引入的建议概念让我们可以衡量在线问题的信息内容。我们证明了哈希的建议复杂度是线性的哈希表的大小。

英文摘要:

In this paper, we analyze hashing from a worst-case perspective. To this end, we study a new property of hash families that is strongly related to d-perfect hashing, namely c-ideality. On the one hand, this notion generalizes the definition of perfect hashing, which has been studied extensively; on the other hand, it provides a direct link to the notion of c-approximativity. We focus on the usually neglected case where the average load αis at least 1 and prove upper and lower parametrized bounds on the minimal size of c-ideal hash families. As an aside, we show how c-ideality helps to analyze the advice complexity of hashing. The concept of advice, introduced a decade ago, lets us measure the information content of an online problem. We prove hashing's advice complexity to be linear in the hash table size.

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

↑