Optimal Random Sampling from Distributed Streams Revisited

DOI10.1007/978-3-642-24100-0_27zbMath1350.68051arXiv1903.12065OpenAlexW135476618WikidataQ60148584 ScholiaQ60148584MaRDI QIDQ3095333

Srikanta Tirthapura, David P. Woodruff

Publication date: 28 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.12065

zbMATH Keywords

samplingdistributed streamsreservoir sampling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items

Towards Optimal Moment Estimation in Streaming and Distributed Models, Improved algorithms for distributed entropy monitoring, Randomized algorithms for tracking distributed count, frequencies, and ranks, Towards Optimal Moment Estimation in Streaming and Distributed Models, Distributed monitoring of election winners, Unnamed Item, Perfect $L_p$ Sampling in a Data Stream, Space-efficient estimation of statistics over sub-sampled streams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal sampling from sliding windows
• Distributed streams algorithms for sliding windows
• Sketching asynchronous data streams over sliding windows
• Effective Computations on Sliding Windows
• Data Streams: Algorithms and Applications
• Functional Monitoring without Monotonicity
• Random sampling with a reservoir
• Continuous sampling from distributed streams