Continuous sampling from distributed streams

DOI10.1145/2160158.2160163zbMath1281.68094OpenAlexW2139076222MaRDI QIDQ5395681

No author found.

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2160158.2160163

zbMATH Keywords

random samplingdistributed tracking

Mathematics Subject Classification ID

Database theory (68P15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (15)

Improved algorithms for distributed entropy monitoring ⋮ Randomized algorithms for tracking distributed count, frequencies, and ranks ⋮ Optimal tracking of distributed heavy hitters and quantiles ⋮ Continuous monitoring of distributed data streams over a time-based sliding window ⋮ Parallel Streaming Random Sampling ⋮ An analysis of query-agnostic sampling for interactive data exploration ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy ⋮ Distributed monitoring of election winners ⋮ Algorithms for k-median Clustering over Distributed Streams ⋮ Optimal Random Sampling from Distributed Streams Revisited ⋮ Perfect $L_p$ Sampling in a Data Stream ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Space-efficient estimation of statistics over sub-sampled streams

This page was built for publication: Continuous sampling from distributed streams