ngosangns Knowledge Base

#count-min-sketch

  • Top K Problem Heavy Hitters
    Compares solutions to the Top K heavy hitters problem at 10 billion views per day (Redis sorted sets, Count-Min Sketch, OLAP pipelines, batch jobs, SQL) and recommends a hybrid fast path plus slow path architecture.