Boosting distinct random sampling for basic counting on the union of distributed streams
type: Item
instance of: scholarly article
title: Boosting distinct random sampling for basic counting on the union of distributed streams
zbMATH Open document ID: 1329.68279
author: Bojian Xu
published in: Theoretical Computer Science
publication date: 2015-09-25T00:00:00Z
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6485291
zbMATH Keywords: basic counting
zbMATH Keywords: data stream
zbMATH Keywords: distributed streams
zbMATH Keywords: coordinated adaptive sampling
zbMATH Keywords: distinct sampling
zbMATH Keywords: direct sampling
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.08.014
OpenAlex ID: W1644787642
cites work: The space complexity of approximating the frequency moments
cites work: Data streams. Models and algorithms.
cites work: Q4440423
cites work: A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
cites work: Universal classes of hash functions
cites work: Algorithms for distributed functional monitoring
cites work: Time-decaying Sketches for Robust Aggregation of Sensor Data
cites work: Maintaining Stream Statistics over Sliding Windows
cites work: Q3152421
cites work: Communication Complexity
cites work: Handbook of finite fields
cites work: Q3425115
cites work: Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
cites work: Sublinear Time Algorithms
cites work: Faster methods for random sampling
cites work: Sketching asynchronous data streams over sliding windows
DOI: 10.1016/J.TCS.2015.08.014
description: scientific article; zbMATH DE number 6485291