关键词: 分布式存储系统, 哈希算法, 散列分布性, 哈希冲突, Davies-Meyer算法

Abstract: Considering the uniform data distribution in physical storage and efficient data positioning in distributed storage system, this paper studies different hash algorithms and proposes how to measure the merits of hash algorithm in distributed storage system. Based on experiments, the detail comparative analysis of various hash algorithms are shown in aspect of hash value distribution, hash conflict and computational efficiency and application scenarios of those algorithms are pointed out. In addition, the optimal scheme combining with distributed storage file system is demonstrated. Experimental results show that Davies-Meyer algorithm has a good uniform distribution and high computational efficiency which is suitable for distributed storage systems.

Key words: distributed storage system, hash algorithm, hash distribution, hash conflict, Davies-Meyer algorithm