We study the well-known frequent items problem in data streams from a competitive analysis point of view. We consider the standard worst-case input model, as well as a weaker distributional adversarial setting. We are primarily interested in the single-slot memory case and for both models we give (asymptotically) tight bounds of and respectively, achieved by very simple and natural algorithms, where N is the stream's length. We also provide lower bounds, for both models, in the more general case of arbitrary memory sizes of k ≥ 1. © 2012 Springer-Verlag.
CITATION STYLE
Giannakopoulos, Y., & Koutsoupias, E. (2012). Competitive analysis of maintaining frequent items of a stream. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7357 LNCS, pp. 340–351). https://doi.org/10.1007/978-3-642-31155-0_30
Mendeley helps you to discover research relevant for your work.