Efficient sampling of non-strict turnstile data streams

DOI10.1007/978-3-642-40164-0_8MaRDI QIDQ2842772zbMATH OpenOpenAlexFDO

Authors Neta Barkay, Ely Porat, Bar Shalem

Publication date 16 August 2013

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40164-0_8

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Theory of data (68P99) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Efficient sampling of non-strict turnstile data streams
• Sampling from Dense Streams without Penalty
• Streaming algorithms via precision sampling
• Stream sampling framework and application for frequency cap statistics
• Optimal Random Sampling from Distributed Streams Revisited

Cited in

(8)

• Efficient sampling of non-strict turnstile data streams
• Sampling from Dense Streams without Penalty
• Time lower bounds for nonadaptive turnstile streaming algorithms
• Optimal Random Sampling from Distributed Streams Revisited
• Stream sampling framework and application for frequency cap statistics
• scientific article; zbMATH DE number 2119720 (Why is no real title available?)
• Faster Update Time for Turnstile Streaming Algorithms
• Deterministic sampling and range counting in geometric data streams

This page was built for publication: Efficient sampling of non-strict turnstile data streams

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