【摘要】 在这个数据量爆炸增长的时代,如何在海量数据中实现对所需数据快速精准的查找成为必须面对的难题。哈希索引(Hash Index)将数据相关值输入哈希函数中,通过哈希函数计算得到哈希码,从而找到数据对应的存储地址。这种方法大大提高了数据检索的速度和准确度并优化了存储空间结构,一定程度上解决了海量数据处理较慢的难题,因此被当今学者广为研究。本文将综述哈希索引的定义和特点,介绍哈希索引的传统算法和新兴算法,最后总结全文并展望未来的研究方向。更多还原

【Abstract】 In this era of explosive growth of data volume, it is a difficult problem to fast achieve and accurately search for required data in big data. The hash index works as follows. The key value of data is input into a hash function, the hash code is then output and used to find the storage address of the data. This method can greatly improve the speed and accuracy of data retrieval and optimizes the storage space. The structure, which can accelerate index processing of massive data to a certain extent, has been widely studied today. This article will give the definition and characteristics of a hash index, introduce the traditional algorithm of hash index and a state-of-the-art algorithm, and finally present a summary and a prospect.更多还原