Boosting distinct random sampling for basic counting on the union of distributed streams

DOI10.1016/J.TCS.2015.08.014MaRDI QIDQ497679zbMATH OpenOpenAlexFDO

Authors Bojian Xu

Publication date 25 September 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.08.014

zbMATH Keywords

direct samplingdata streambasic countingcoordinated adaptive samplingdistinct samplingdistributed streams

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Optimal Random Sampling from Distributed Streams Revisited
• scientific article; zbMATH DE number 2019620
• A framework for estimating stream expression cardinalities
• Distributed streams algorithms for sliding windows

Cites work

• scientific article; zbMATH DE number 1819631 (Why is no real title available?)
• scientific article; zbMATH DE number 2019620 (Why is no real title available?)
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• Algorithms for distributed functional monitoring
• Communication Complexity
• Data streams. Models and algorithms.
• Data streams: algorithms and applications.
• Faster methods for random sampling
• Handbook of finite fields
• Maintaining Stream Statistics over Sliding Windows
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Sketching asynchronous data streams over sliding windows
• Sublinear time algorithms
• The space complexity of approximating the frequency moments
• Time-decaying sketches for robust aggregation of sensor data
• Universal classes of hash functions

Cited in

(6)

• On Local Distributed Sampling and Counting
• Efficient sampling of non-strict turnstile data streams
• Counting distinct items over update streams
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Optimal Random Sampling from Distributed Streams Revisited
• Randomized algorithms for tracking distributed count, frequencies, and ranks

This page was built for publication: Boosting distinct random sampling for basic counting on the union of distributed streams

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