Distributed streams algorithms for sliding windows
From MaRDI portal
Publication:706324
DOI10.1007/S00224-004-1156-4zbMATH Open1093.68143DBLPjournals/mst/GibbonsT04OpenAlexW2166502998WikidataQ60148609 ScholiaQ60148609MaRDI QIDQ706324FDOQ706324
Authors: Phillip B. Gibbons, Srikanta Tirthapura 
Publication date: 8 February 2005
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-004-1156-4
Recommendations
Cited In (39)
- Linked-tree: An aggregate query algorithm based on sliding window over data stream
- Give me some slack: efficient network measurements
- Continuous sampling from distributed streams
- Sketching asynchronous data streams over sliding windows
- Title not available (Why is that?)
- Succinct summing over sliding windows
- Optimal sampling from sliding windows
- Maintaining Stream Statistics over Sliding Windows
- 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
- Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream
- Dynamically computing approximate frequency counts in sliding window over data stream
- On distributing symmetric streaming computations
- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
- Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window
- A general method for estimating correlated aggregates over a data stream
- Sliding-window probabilistic threshold aggregate queries on uncertain data streams
- Give me some slack: efficient network measurements
- Title not available (Why is that?)
- Improved Algorithms for Time Decay Streams
- Improved algorithms for polynomial-time decay and time-decay with additive error
- Title not available (Why is that?)
- New algorithms for distributed sliding windows
- Derandomization for sliding window algorithms with strict correctness
- Derandomization for sliding window algorithms with strict correctness
- Greedily computing associative aggregations on sliding windows
- Zero-one laws for sliding windows and universal sketches
- Time-decayed correlated aggregates over data streams
- Nearly optimal distinct elements and heavy hitters on sliding windows
- Longest increasing subsequences in sliding windows
- Optimal Random Sampling from Distributed Streams Revisited
- Effective computations on sliding windows
- Communication-efficient distributed covariance sketch, with application to distributed PCA
- Boosting distinct random sampling for basic counting on the union of distributed streams
- Improved algorithms for distributed entropy monitoring
- Estimating the number of active flows in a data stream over a sliding window
- Distributed streaming with finite memory
- Approximate query processing over static sets and sliding windows
This page was built for publication: Distributed streams algorithms for sliding windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706324)
