Identifying frequent items in a network using gossip

DOI10.1016/J.JPDC.2010.07.006zbMATH Open1233.68065OpenAlexW2061373204WikidataQ60148589 ScholiaQ60148589MaRDI QIDQ666263FDOQ666263

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)

Cites Work

• Finding repeated elements
• Title not available (Why is that?)
• Probability and Computing
• The shortest-path problem for graphs with random arc-lengths
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient top-K query calculation in distributed networks
• Computing separable functions via gossip
• Geographic Gossip: Efficient Averaging for Sensor Networks

Cited In (4)

• Distributed data summarization in well-connected networks
• Distributed mining of time-faded heavy hitters
• Identifying frequent items in distributed data sets
• Mining frequent items in data stream using time fading model

   Recommendations

• Identifying frequent items in distributed data sets 👍 👎
• ProFID: practical frequent item set discovery in peer-to-peer networks 👍 👎
• Distributed mining of time-faded heavy hitters 👍 👎
• P2P-FISM: mining (recently) frequent item sets from distributed data streams over P2P network 👍 👎
• In-network estimation of frequency moments 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666263)