哈希

First, three common word segmentation dictionary systems and the dictionary system based on double-character-hash-indexing, Patricia tree and four-character-hash-indexing are studied and explored. Some questions are found in these systems and the unreasonable structures are improved.

本文对三种典型的分词词典机制、基于双字哈希的词典机制、基于PAT树的词典机制及四字哈希词典机制进行了探讨与研究，并针对这些机制存在的问题提出了改进措施。

An example of such an assumption that the hash algorithm is the same for dictionary implementations; because we use Java's ( ConcurrentHashMap), this is not the case.

例如有这样一个假设：哈希算法与字典的实现算法是一样的，因为我们使用Java的哈希表（ConcurrentHashMap），所以这个假设是不成立的。

Bloom Filter is an excellent data structure, which can succinctly represent a data set in order to support membership queries. It is widely used in databases, networks and distributed system.

Bloom filter哈希算法采用位向量来存储数据集合，能有效支持元素的哈希查找，是一种能够简洁地表示数据集合并支持集合查询的索引结构，广泛应用于数据库、网络和分布式系统中。