Bloom Filters in Storage Engines: Cheap Negative Lookups
How Bloom filters avoid disk reads in LSM trees and caches, how false positives behave, and when a cuckoo or ribbon filter is the better structure.
4 min read
Tag
2 articles · 8 min of reading
How Bloom filters avoid disk reads in LSM trees and caches, how false positives behave, and when a cuckoo or ribbon filter is the better structure.
Why Uber built a hexagonal hierarchical grid system to power surge pricing, ETAs, and driver-rider matching, and open sourced it as H3.