Identifying frequent items in distributed data sets

DOI10.1007/s00607-012-0220-1zbMath1314.68388OpenAlexW2019955245WikidataQ61717246 ScholiaQ61717246MaRDI QIDQ488300

Jan Sacha, Alberto Montresor

Publication date: 26 January 2015

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-012-0220-1

zbMATH Keywords

aggregationfrequencyfrequent items discoverygossip-based algorithmsmost frequent items in large-scale distributed datasets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (1)

Distributed mining of time-faded heavy hitters

Uses Software

• PeerSim

Cites Work

• Identifying frequent items in a network using gossip
• Finding frequent items in data streams
• Efficient top-K query calculation in distributed networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Identifying frequent items in distributed data sets