Maintaining Stream Statistics over Sliding Windows
From MaRDI portal
Publication:4785622
DOI10.1137/S0097539701398363zbMath1008.68039MaRDI QIDQ4785622
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani
Publication date: 5 January 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539701398363
68Q25: Analysis of algorithms and problem complexity
68P05: Data structures
68W25: Approximation algorithms
68W27: Online algorithms; streaming algorithms
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows., Efficient Error-Correcting Codes for Sliding Windows, A survey on concept drift adaptation, Tight bounds for sliding Bloom filters, Derandomization for sliding window algorithms with strict correctness, Improved Algorithms for Time Decay Streams, Unnamed Item, Loda: lightweight on-line detector of anomalies, Space lower bounds for online pattern matching, Greedily computing associative aggregations on sliding windows, Recentness biased learning for time series forecasting, Boosting distinct random sampling for basic counting on the union of distributed streams, A general method for estimating correlated aggregates over a data stream, Streaming algorithms for robust submodular maximization, Spatially-decaying aggregation over a network, Approximating frequent items in asynchronous data stream over a sliding window, Succinct summing over sliding windows, Longest increasing subsequences in sliding windows, On evaluating stream learning algorithms, Sketching asynchronous data streams over sliding windows, Approximate query processing over static sets and sliding windows, Almost-smooth histograms and sliding-window graph algorithms, Dynamic data structures for timed automata acceptance, Top-\(k\) frequent items and item frequency tracking over sliding windows of any size, Give me some slack: efficient network measurements, Continuous monitoring of distributed data streams over a time-based sliding window, Improved algorithms for polynomial-time decay and time-decay with additive error, Smoothness of Schatten norms and sliding-window matrix streams, Computing (and Life) Is All about Tradeoffs, Indexing for summary queries, Space Lower Bounds for Online Pattern Matching, Unnamed Item
