Identifying frequent items in a network using gossip

DOI10.1016/j.jpdc.2010.07.006zbMath1233.68065OpenAlexW2061373204WikidataQ60148589 ScholiaQ60148589MaRDI QIDQ666263

Srikanta Tirthapura, Bibudh Lahiri

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.07.006

zbMATH Keywords

sketchgossipfrequent items

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14)

Related Items (3)

Identifying frequent items in distributed data sets ⋮ Mining frequent items in data stream using time fading model ⋮ Distributed mining of time-faded heavy hitters

Cites Work

• The shortest-path problem for graphs with random arc-lengths
• Finding repeated elements
• Geographic Gossip: Efficient Averaging for Sensor Networks
• Computing separable functions via gossip
• Probability and Computing
• Efficient top-K query calculation in distributed networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Identifying frequent items in a network using gossip