Boosting distinct random sampling for basic counting on the union of distributed streams
From MaRDI portal
Publication:497679
DOI10.1016/J.TCS.2015.08.014zbMATH Open1329.68279OpenAlexW1644787642MaRDI QIDQ497679FDOQ497679
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
Recommendations
direct samplingdata streambasic countingcoordinated adaptive samplingdistinct samplingdistributed streams
Cites Work
- The space complexity of approximating the frequency moments
- Data streams. Models and algorithms.
- Universal classes of hash functions
- Handbook of finite fields
- Sublinear time algorithms
- Data streams: algorithms and applications.
- Communication Complexity
- Maintaining Stream Statistics over Sliding Windows
- Algorithms for distributed functional monitoring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
- Faster methods for random sampling
- Sketching asynchronous data streams over sliding windows
- Time-decaying sketches for robust aggregation of sensor data
- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
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)
