Performance Measures for Frequent Items in Online Streaming
Joan Boyar, Kim S. Larsen and Abyayananda Maiti
FCT 2013.

We study various performance measures and their applicability to an online streaming problem, the Frequent Items Problem. Researchers have studied this problem using Competitive Analysis to compare various online algorithms developed for solving it. Those analyses showed that, according to Competitive Analysis, the basic naive algorithm is the best, with the more complex algorithms performing poorly in comparison. In our study we apply other standard measures to analyze those algorithms.

Last modified: Mon Apr 15 10:00:43 CEST 2013