一种基于学习的自适应哈希算法研究

The Study of an Learning-Based Adaptive Hash Algorithm

通常在一般关系数据库中采用的哈希函数都是针对某一应用而设计的。在具体应用中该函数也许是最优化的,但不能保证该函数适用于其他应用场合。本文提出一种基于枚举的自适应哈希算法并对该算法进行研究。实验表明,该算法能够使数据分布达到最优化,显著地提高数据的存取和查询效率。

Generally speaking hash function is designed for one application. It m ay be the optimistic for this application. But it could not warrant that it is s uitable for any other applications. The paper presents an enumeration-based adap tive hash algorithm and its improved edition. The experiment indicates that this new function could optimize the data distribution in order to improve the effic iency of the data access and query dramatically.