Database Paper Browser

Back to papers

Variability in Data Streams

Summary: Introduce a stream parameter “variability” v for distributed non‑monotonic update streams and show how to adapt monotone-stream algorithms to track integer functions with small relative error so communication scales as Õ(v) instead of Θ(n). Prove v=O(log f(n)) for monotone streams and v=o(n) for nearly‑monotone or random-walk inputs, implying practical, smoothly degrading communication bounds and minor algorithmic modifications. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1672
Venue
PODS
Year
2016
Pagerank
4.1945683e-05
Overall Rank
11,823 | 17.75%
DOI
10.1145/2902251.2902277

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers