Comments on "An Integrated Efficient Solution for Computing Frequent and Top-k Elements in Data Streams"
We investigate a well-known algorithm, Space-Saving [Metwally et al. 2006], which has been proven efficient and effective at mining frequent elements in data streams. We discovered an error in one of the theorems in Metwally et al. [2006]. Experiments are conducted to illustrate the error.
top-k elements data streams algorithms frequent elements performance zipfian distributions approximate queries