A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window

DOI10.1007/978-3-540-70918-3_40zbMath1186.68014OpenAlexW1541493329MaRDI QIDQ3590955

Srikanta Tirthapura, Costas Busch

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_40

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Continuous monitoring of distributed data streams over a time-based sliding window, Sketching asynchronous data streams over sliding windows, Approximating frequent items in asynchronous data stream over a sliding window, Boosting distinct random sampling for basic counting on the union of distributed streams, Mining frequent items in data stream using time fading model, Identifying correlated heavy-hitters in a two-dimensional data stream, A general method for estimating correlated aggregates over a data stream