Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors
Summary: Near-complete characterization: Σ_i g(|f_i|) admits sublinear (polylog/subpoly) streaming approximation iff g meets a simple analytic condition, up to a narrow pathological class. Covers convex/concave/monotone, polynomial, trigonometric and—first for nonmonotone—g, resolving AMS'96 for almost all one-variable functions. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Vladimir Braverman (Johns Hopkins University)
- 2. Stephen R. Chestnut (ETH Zurich)
- 3. David P. Woodruff (IBM)
- 4. Lin F. Yang (Johns Hopkins University)
BibTeX Citation
@inproceedings{braverman_pods16,
address = {New York, NY, USA},
series = {{PODS} '16},
title = {{Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors}},
url = {https://dl.acm.org/doi/10.1145/2902251.2902282},
doi = {10.1145/2902251.2902282},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Braverman, Vladimir and Chestnut, Stephen R. and Woodruff, David P. and Yang, Lin F.},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,865 | Approximation-First Timeseries Query At Scale | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,257 | Automatic Optimization for MapReduce Programs | 2011 | VLDB | 0.000114432 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,698 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS |
| 2 | 3,628 | Space Complexity of Hierarchical Heavy Hitters in Multi-Dimensional Data Streams | 2005 | PODS |
| 3 | 122 | Approximate Frequency Counts over Data Streams | 2002 | VLDB |
| 4 | 12,305 | Space-Efficient Estimation of Statistics over Sub-Sampled Streams | 2012 | PODS |
| 5 | 6,454 | An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems | 2016 | PODS |
| 6 | 11,638 | Frequent Elements with Witnesses in Data Streams | 2021 | PODS |
| 7 | 11,123 | Streaming Algorithms with Few State Changes | 2024 | PODS |
| 8 | 1,600 | Space-optimal Heavy Hitters with Strong Error Bounds | 2009 | PODS |
| 9 | 5,669 | Data Streams with Bounded Deletions | 2018 | PODS |
| 10 | 12,026 | Variability in Data Streams | 2016 | PODS |