Sketching asynchronous streams over a sliding window

DOI10.1145/1146381.1146397MaRDI QIDQ5177269zbMATH OpenOpenAlexFDO

Authors Srikanta Tirthapura, Bojian Xu, Costas Busch

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

aggregatesasynchronous streamsdata stream processingdistributed streamssketches of streamssliding windowsunion of streams

Mathematics Subject Classification ID

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

Recommendations

• Sketching asynchronous data streams over sliding windows
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• Approximating frequent items in asynchronous data stream over a sliding window
• Distributed streams algorithms for sliding windows
• scientific article; zbMATH DE number 2119721

Cited in

(7)

• Approximating frequent items in asynchronous data stream over a sliding window
• Sketching asynchronous data streams over sliding windows
• Asynchronous sliding block maps
• Streaming Embeddings with Slack
• Approximating frequent items in asynchronous data stream over a sliding window
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• A general method for estimating correlated aggregates over a data stream

This page was built for publication: Sketching asynchronous streams over a sliding window

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177269)