Sketching asynchronous streams over a sliding window

DOI10.1145/1146381.1146397zbMath1314.68123OpenAlexW2123873233MaRDI QIDQ5177269

Costas Busch, Srikanta Tirthapura, Bojian Xu

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1146381.1146397

zbMATH Keywords

sliding windowsaggregatesdistributed streamsdata stream processingasynchronous streamssketches of streamsunion of streams

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) Distributed systems (68M14) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Sketching asynchronous data streams over sliding windows, Approximating frequent items in asynchronous data stream over a sliding window, A general method for estimating correlated aggregates over a data stream