TY  - JOUR
AU  - Cafaro, Massimo
AU  - Pulimeno, Marco
AU  - Tempesta, Piergiulio
PY  - 2016
DO  - 10.1016/j.ins.2015.09.003
SN  - 0020-0255
UR  - https://hdl.handle.net/20.500.14352/23153
T2  - Information sciences
AB  - We present a message-passing based parallel version of the Space Saving algorithm designed to solve the k-majority problem. The algorithm determines in parallel frequent items, i.e., those whose frequency is greater than a given threshold, and is...
LA  - eng
M2  - 1
PB  - Elsevier  Science Inc
KW  - Finding frequent
KW  - Elements
KW  - Streams
TI  - A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
TY  - journal article
VL  - 329
ER  -