一种获取内存受限的近完美哈希的遗传算法
A Genetic Algorithm for Obtaining Memory Constrained Near-Perfect Hashing
摘要:
在大多数计算机科学领域,从操作系统组件到数据库和用户界面,经常遇到从固定集合中快速检索项目的问题。我们提出了一种基于哈希表的方法,重点是最小化搜索过程中执行的比较次数和最小化总集合大小。标准的开放寻址双散列方法通过非线性变换得到改进,该非线性变换可以被参数化以确保数据在哈希表中的均匀分布。采用遗传算法确定最优参数。论文结果表明,近似完美散列比二进制搜索更快,但比完美散列使用更少的内存,对于搜索时间也很关键的内存受限应用程序来说是一个很好的选择。
英文摘要:
The problem of fast items retrieval from a fixed collection is often encountered in most computer science areas, from operating system components to databases and user interfaces. We present an approach based on hash tables that focuses on both minimizing the number of comparisons performed during the search and minimizing the total collection size. The standard open-addressing double-hashing approach is improved with a non-linear transformation that can be parametrized in order to ensure a uniform distribution of the data in the hash table. The optimal parameter is determined using a genetic algorithm. The paper results show that near-perfect hashing is faster than binary search, yet uses less memory than perfect hashing, being a good choice for memory-constrained applications where search time is also critical.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。