Probability, Statistics, Distributed Systems, Software Engineering, Interview Questions.
Problem) and let N be the number of cache entries. Xi in this example denotes the number of queries before the Si-th cache entry is accessed for the 1st time. Thus, E = N*(1 + 1/2 + 1/3 + …. + 1/N) In a TTL based caching, the average duration between access of a key is T, how should you choose TTL,