Efficiently Finding Top K Items from Evolving Distributed Data Streams
The problem of efficiently finding top k frequent items has attracted much attention in recent years. Storage constraints in the processing node and intrinsic evolving feature of the data streams are two main challenges. In this paper, we propose a method to tackle these two challenges based on space saving and gossip based algorithms respectively. Our method is implemented on SAMOA, a scalable advanced massive online analysis machine learning framework. The experimental results show its effectiveness and scalability.
2014 10th International Conference on Semantics, Knowledge and Grids