A real-time algorithm for finding frequent items over sliding window

摘要

The Paper presents an improved algorithm for finding frequent elements over a sliding window. It makes no assumption on the distribution of the input items' frequency. Its main structure composes of only a few maps and short queues. By using hash table and other data structure to manage counters, the running time is dramatically decreased. After thorough experiment and logical analysis, the running time has reduced to constant.