2017-Let’s Implement a Bloom Filter in Go: I remember some time ago while I was reading some articles about Cassandra internals that it used bloom filters to check if the particular SSTables are likely to have the request partition data.
SuRF，BloomFilter 的替代品？: SuRF 是一种查询效率高、压缩比高的字典树（Trie）数据结构，其功能十分简单，提供过滤器的功能。
SuRF #Project#: First Practical and General-purpose Range Filter
Hashids: Hashids is a small open-source library that generates short, unique, non-sequential ids from numbers.
I Wrote The Fastest Hashtable: Now I finally wrote the fastest hashtable. And by that I mean that I have the fastest lookups of any hashtable I could find, while my inserts and erases are also really fast. (but not the fastest)
2017-Hashing Out Hash Functions: let’s find out more about hash functions, how they work, and their strengths and weakness. Hopefully, this will help us understand when exactly they can help us out!