Finding Top-k Most Frequent Items in Distributed Streams in the Time-Sliding Window Model - IMT Atlantique Access content directly
Conference Papers Year : 2018

Finding Top-k Most Frequent Items in Distributed Streams in the Time-Sliding Window Model

Abstract

We propose a new probabilistic algorithm to find the top-k most recent and frequent items in distributed streams. This algorithm significantly improves upon the reliability and accuracy of existing results, while significantly reducing the memory footprint needed by each of the distributed nodes to solve this problem.
Fichier principal
Vignette du fichier
finding-top-k.pdf (201.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01839930 , version 1 (16-07-2018)

Identifiers

Cite

Emmanuelle Anceaume, Yann Busnel, Vasile Cazacu. Finding Top-k Most Frequent Items in Distributed Streams in the Time-Sliding Window Model. DSN 2018 - 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Jun 2018, Luxembourg, Luxembourg. pp.1-2, ⟨10.1109/DSN-W.2018.00030⟩. ⟨hal-01839930⟩
296 View
693 Download

Altmetric

Share

Gmail Facebook X LinkedIn More