Abstract: A segment hash with inversed insertion based on peacock hash and segment hash was proposed. This algorithm ensured the average times of off-chip access close to 1 through changing the operating sequence and data structure of peacock hash. The analysis and experimental results show that the algorithm has high efficiency and can reduce the memory overhead.

Key words: peacock hash, segment hash, bitmap array, Bloom Filter (BF), memory

摘要： 受到孔雀哈希与分段哈希算法的启发，提出了一种新的倒插入分段哈希表。该算法从改变表的操作顺序及修改孔雀哈希数据结构着手，保证了片外访问的平均次数接近于1。分析与实验表明，该算法具有较高的效率，降低了内存开销。

关键词: 孔雀哈希, 分段哈希, 位图数组, 布鲁姆过滤器, 内存