A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
From MaRDI portal
Publication:3590955
DOI10.1007/978-3-540-70918-3_40zbMATH Open1186.68014OpenAlexW1541493329MaRDI QIDQ3590955FDOQ3590955
Authors: Costas Busch, Srikanta Tirthapura 
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
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)
Cited In (14)
- Sketching asynchronous data streams over sliding windows
- Title not available (Why is that?)
- Competitive Analysis of Aggregate Max in Windowed Streaming
- Continuous monitoring of distributed data streams over a time-based sliding window
- Sketching asynchronous streams over a sliding window
- Approximating frequent items in asynchronous data stream over a sliding window
- A general method for estimating correlated aggregates over a data stream
- Algorithms and estimators for summarization of unaggregated data streams
- Time-decayed correlated aggregates over data streams
- Identifying correlated heavy-hitters in a two-dimensional data stream
- 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
- CR-precis: A Deterministic Summary Structure for Update Data Streams
This page was built for publication: A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590955)
