Sketching asynchronous data streams over sliding windows

DOI10.1007/s00446-007-0048-7zbMath1266.68107OpenAlexW2119163494WikidataQ60148596 ScholiaQ60148596MaRDI QIDQ1954256

Costas Busch, Bojian Xu, Srikanta Tirthapura

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-007-0048-7

zbMATH Keywords

mediansliding windowdata streamssumdistributed streamsasynchronous streams

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Distributed systems (68M14) Randomized algorithms (68W20)

Related Items

Parallel Streaming Random Sampling, Boosting distinct random sampling for basic counting on the union of distributed streams, Identifying correlated heavy-hitters in a two-dimensional data stream, A general method for estimating correlated aggregates over a data stream, Optimal Random Sampling from Distributed Streams Revisited

Uses Software

• TAG

Cites Work

• Distributed streams algorithms for sliding windows
• Computing diameter in the streaming and sliding-window models
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• Maintaining Stream Statistics over Sliding Windows
• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• Sketching asynchronous streams over a sliding window
• A note on efficient aggregate queries in sensor networks
• Space/time trade-offs in hash coding with allowable errors