Sketching asynchronous data streams over sliding windows

DOI10.1007/S00446-007-0048-7MaRDI QIDQ1954256zbMATH OpenOpenAlexWikidataFDO

Authors Bojian Xu, Srikanta Tirthapura, Costas Busch

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

asynchronous streamsdata streamsdistributed streamsmediansliding windowsum

Mathematics Subject Classification ID

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

Recommendations

• Sketching asynchronous streams over a sliding window
• Approximating frequent items in asynchronous data stream over a sliding window
• Approximating frequent items in asynchronous data stream over a sliding window
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• Distributed streams algorithms for sliding windows

Cites work

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

Cited in

(10)

• Approximating frequent items in asynchronous data stream over a sliding window
• Identifying correlated heavy-hitters in a two-dimensional data stream
• Optimal Random Sampling from Distributed Streams Revisited
• Parallel streaming random sampling
• Approximating frequent items in asynchronous data stream over a sliding window
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• Boosting distinct random sampling for basic counting on the union of distributed streams
• Sketching asynchronous streams over a sliding window
• Time-decayed correlated aggregates over data streams
• A general method for estimating correlated aggregates over a data stream

Describes a project that uses

Uses Software

• TAG

This page was built for publication: Sketching asynchronous data streams over sliding windows

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