摘要: #Trie Tree的基本特点
1）根节点不包含字符，除根节点外每个节点只包含一个字符
2）从根节点到某一个节点，路径上经过的字符连接起来，为该节点对应的字符串
3）每个节点的所有子节点包含的字符串不相同
阅读全文
摘要: The Bloom filter, conceived by Burton Howard Bloom in 1970, is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.False positivesare possible, but false negatives are not. Elements can be added to the set, but not removed (though this can be addressed with a counting filter). The more elements that are added to the set, the larger the probability of false positives
阅读全文