Rapid access to information is essential for a wide variety of retrieval systems and applications. Hashing has long been used when the fastest possible direct search is desired, but is generally not appropriate when sequential or range searches are also required. This paper describes a hashing method, developed for collections that are relatively static, that supports both direct and sequential access. Indeed, the algorithm described gives hash functions that are optimal in terms of time and hash table space utilization, and that preserve any a priori ordering desired. Furthermore, the resulting order preserving minimal perfect hash functions (OPMPHFs) can be found using space and time that is on average linear in the number of keys involved.
对于各种检索系统和应用程序而言,快速访问信息至关重要。长期以来,当需要尽可能快的直接搜索时,就使用散列法,但是当同时需要顺序或范围搜索时,散列法通常是不合适的。本文介绍了一种为相对静态的集合开发的哈希方法,该方法同时支持直接访问和顺序访问。实际上,所描述的算法给出了在时间和哈希表空间利用率方面最佳的哈希函数,并且保留了所需的任何先验顺序。此外,可以使用空间和时间找到保留最小完美哈希函数(OPMPHF)的结果,该空间和时间在所涉及的键数上平均是线性的。 P>
机译:快速可扩展结构([压缩]静态|最小完美散列)功能
机译:生成最小完美哈希函数的模拟退火算法
机译:大规模图像检索的概率序数保留语义散列
机译:大型数字图书馆的增强顺序保留最小完美哈希函数
机译:有序最小完美散列函数的并行生成。
机译:无监督跨模型检索的深度语义保留重建散列
机译:散列和位移:最小完美散列函数的有效评估