Sketching asynchronous data streams over sliding windows
type: Item
instance of: scholarly article
title: Sketching asynchronous data streams over sliding windows
zbMATH Open document ID: 1266.68107
author: Bojian Xu
author: Srikanta Tirthapura
author: Costas Busch
published in: Distributed Computing
publication date: 2013-06-20T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 6177664
zbMATH Keywords: data streams
zbMATH Keywords: asynchronous streams
zbMATH Keywords: distributed streams
zbMATH Keywords: sliding window
zbMATH Keywords: sum
zbMATH Keywords: median
describes a project that uses: TAG
Wikidata QID: Q60148596
MaRDI profile type: Publication
full work available at URL: s00446-007-0048-7
OpenAlex ID: W2119163494
cites work: Space/time trade-offs in hash coding with allowable errors
cites work: A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
cites work: Maintaining Stream Statistics over Sliding Windows
cites work: Computing diameter in the streaming and sliding-window models
cites work: Distributed streams algorithms for sliding windows
cites work: A note on efficient aggregate queries in sensor networks
cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence
cites work: Sketching asynchronous streams over a sliding window
DOI: 10.1007/S00446-007-0048-7
Recommended article: Sketching asynchronous streams over a sliding window
Recommended article: Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window
Recommended article: Approximating frequent items in asynchronous data stream over a sliding window
Recommended article: A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
Recommended article: Distributed streams algorithms for sliding windows
description: scientific article; zbMATH DE number 6177664