Tag
resizing
- May 20, 2026 Growing and Ageing a Filter Without Rebuilding It Scalable Bloom filters add slices with tightening error instead of rehashing, and decaying sketches replace deletion with a time constant that bounds the effective window. data structures
- Apr 9, 2026 Incremental Rehashing: Spreading a Resize Across Operations How two tables and a migration cursor turn an O(n) resize pause into constant work per operation, and what lookups must do while both tables are live. data structures
- Jan 7, 2026 Separate Chaining and the Load-Factor Threshold How a bucket array with per-bucket lists produces expected constant-time lookup, what the load factor controls, and why chained tables keep working above a load of one. data structures