Known limitations: the fundamental limitations stem from the "hopping window" (HW) nature of the underlying algorithm. HW is a compromise between "sliding window" and "tumbling window" algorithms. The sliding window shifts continuously in time and holds all events. As a result, it is accurate, continuous, and expensive in storage. The tumbling window scales well because it shifts with time by the whole window length and can keep the window representation, such as sum or count, aggregated. The hopping window is broken into several equal fragments, each with an aggregated representation: count or sum—the time window shifts to the right discreetly by fragment length whenever its time is due. As a result, the algorithm only holds as many aggregated values as the number of fragments (4 by default) and scales well. Unlike a trembling window, previous "window history" is not lost upon a shift, only a fragment, and so a more continuous effect is achieved.