A Two-List Framework for Accurate Detection of Frequent Items in Data Streams

  • David VengerovEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10934)


The problem of detecting the most frequent items in large data sets and providing accurate frequency estimates for those items is becoming more and more important in a variety of domains. We propose a new two-list framework for addressing this problem, which extends the state-of-the-art Filtered Space-Saving (FSS) algorithm. An algorithm called FSSA giving an efficient array-based implementation of this framework is presented. An adaptive version of this algorithm is also presented, which adjusts the relative sizes of the two lists based on the estimated number of distinct keys in the data set. Analytical comparison with the FSS algorithm showed that FSSA has smaller expected frequency estimation errors, and experiments on both artificial and real workloads confirm this result. A theoretical analysis of space and time complexity for FSSA and its benchmark algorithms was performed. Finally, we showed that FSS2L framework can be naturally parallelized, leading to a linear decrease in the maximum frequency estimation error.


Data mining Frequent items Skew detection Space-Saving 


  1. 1.
    Cormode, G., Hadjieleftheriou, M.: Finding frequent items in data streams. VLDB Endowment 1(2), 1530–1541 (2008)CrossRefGoogle Scholar
  2. 2.
    Das, S., Antony, S., Agrawal, D., El Abbadi, A.: Thread cooperation in multicore architectures for frequency counting over multiple data streams. VLDB Endowment 2(1), 217–228 (2009)CrossRefGoogle Scholar
  3. 3.
    Demaine, E., López-Ortiz A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: Proceedings of the European Symposium on Algorithms (ESA), pp. 348–360 (2002)CrossRefGoogle Scholar
  4. 4.
    Flajolet, P., Fusy, E., Gandouet, O., Meunier, F.: Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In: Proceedings of the 13th Conference on Analysis of Algorithm, pp. 127–146 (2007)Google Scholar
  5. 5.
    Homem, N., Carvalho, J.: Finding top-k elements in data streams. Inf. Sci. 180(24), 4958–4974 (2010)CrossRefGoogle Scholar
  6. 6.
    Manku, G., Motwani R.: Approximate frequency counts over data streams. In: Proceedings of 28th International Conference on Very Large Data Bases (VLDB), pp. 346–357. Morgan Kaufmann, Hong Kong (2002)CrossRefGoogle Scholar
  7. 7.
    Manerikar, N., Palpanas, T.: Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl. Eng. 68(4), 415–430 (2009)CrossRefGoogle Scholar
  8. 8.
    Metwally, A., Agrawal, D., El Abbadi, A.: Efficient computation of frequent and top-k elements in data streams. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 398–412. Springer, Heidelberg (2004). Scholar
  9. 9.

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Oracle LabsBelmontUSA

Personalised recommendations