摘要: #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
閱讀全文