// TOPIC
#probabilistic-data-structures
2 articles
◆◆◆AdvancedRedisGoogle
01Skip Lists: The Structure Redis Chose Over Balanced Trees
Skip lists replace tree rotations with coin flips: expected O(log n) search, insert, and delete in ~40 lines. Why Redis, LevelDB, and Java picked them.
#skip-lists#linked-lists#probabilistic-data-structures
18 min◆◆◆AdvancedGoogleAmazon
02Bloom Filters
How a bloom filter answers 'definitely not' or 'maybe yes' in ~10 bits per item: the math behind 1% fpp, working Python code, and production uses.
#bloom-filters#probabilistic-data-structures#hashing
13 min