Distributed streams algorithms for sliding windows
From MaRDI portal
Publication:706324
DOI10.1007/s00224-004-1156-4zbMath1093.68143OpenAlexW2166502998WikidataQ60148609 ScholiaQ60148609MaRDI QIDQ706324
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
Related Items
Longest increasing subsequences in sliding windows, Dynamically computing approximate frequency counts in sliding window over data stream, Improved algorithms for distributed entropy monitoring, Unnamed Item, Optimal sampling from sliding windows, Continuous monitoring of distributed data streams over a time-based sliding window, Unnamed Item, Sketching asynchronous data streams over sliding windows, Improved Algorithms for Time Decay Streams, Succinct summing over sliding windows, Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows., Improved algorithms for polynomial-time decay and time-decay with additive error, Give me some slack: efficient network measurements, Unnamed Item, A general method for estimating correlated aggregates over a data stream, Optimal Random Sampling from Distributed Streams Revisited
