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