A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
From MaRDI portal
Publication:3590955
Recommendations
Cited in
(14)- CR-precis: A Deterministic Summary Structure for Update Data Streams
- Sketching asynchronous data streams over sliding windows
- Algorithms and estimators for summarization of unaggregated data streams
- A general method for estimating correlated aggregates over a data stream
- Continuous monitoring of distributed data streams over a time-based sliding window
- Time-decayed correlated aggregates over data streams
- scientific article; zbMATH DE number 2119721 (Why is no real title available?)
- Sketching asynchronous streams 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
- Approximating frequent items in asynchronous data stream over a sliding window
- Competitive Analysis of Aggregate Max in Windowed Streaming
- Approximating frequent items in asynchronous data stream over a sliding window
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)