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

用SAT技术构造最小完美Hash函数

Constructing Minimal Perfect Hash Functions Using SAT Technology

Sean Weaver, Marijn Heule

摘要:

最小完美散列函数(MPHF)用于提供对大型字典(键值对集)值的有效访问。发现用于构建MPHF的新算法是一个活跃的研究领域,特别是从存储效率的角度来看。MPHF的信息理论限制是1/(ln 2)或每个密钥大约1.44比特。目前最好的实用算法范围在每个密钥2到4位之间。在这篇文章中,我们提出了两个基于SAT的MPHF结构。我们的第一个建设产生MPHF附近的信息理论的限制。对于这种构造,当前最先进的SAT求解器可以处理字典包含多达40个元素的情况,从而优于现有的(蛮力)方法。我们的第二个构造使用XOR-SAT滤波器来实现每个密钥约1.83位的长期存储的实用方法。

英文摘要:

Minimal perfect hash functions (MPHFs) are used to provide efficient access to values of large dictionaries (sets of key-value pairs). Discovering new algorithms for building MPHFs is an area of active research, especially from the perspective of storage efficiency. The information-theoretic limit for MPHFs is 1/(ln 2) or roughly 1.44 bits per key. The current best practical algorithms range between 2 and 4 bits per key. In this article, we propose two SAT-based constructions of MPHFs. Our first construction yields MPHFs near the information-theoretic limit. For this construction, current state-of-the-art SAT solvers can handle instances where the dictionaries contain up to 40 elements, thereby outperforming the existing (brute-force) methods. Our second construction uses XOR-SAT filters to realize a practical approach with long-term storage of approximately 1.83 bits per key.

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

↑