3 docs tagged with "algorithms"

Why a burst of one-hit-wonders evicts your most valuable keys under LRU, how Count-Min Sketch admission control fixes it, and when SLRU or 2Q are enough.

Polyline segment matching with R-trees and Fréchet distance, FIT file ingestion spikes, leaderboards in sorted sets, GPS and elevation noise, privacy zones, and anti-cheat.

Count-Min Sketch and Space-Saving for memory-bounded heavy hitters, exponential decay for non-stationary popularity, two-tier top-k merging, and why approximate merges are not exact.