Probability, Statistics, Distributed Systems, Software Engineering, Interview Questions.
accessing each key is p1, p2, …pN. What strategy would you use to partition the keys across K partitions such that the expected number of requests to each partition is roughly the same? One strategy is that, if N keys are randomly distributed across K partitions, then each partition will have