Database Paper Browser

Back to papers

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)

Paper ID
1677
Venue
PODS
Year
2016
Pagerank
4.3047774e-05
Overall Rank
9,685 | 32.63%
DOI
10.1145/2902251.2902282

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,608 Approximation-First Timeseries Query At Scale 2025 VLDB 4.1945683e-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,280 Automatic Optimization for MapReduce Programs 2011 VLDB 0.0001285503
Previous Page 1 / 1 Next

Semantically Similar Papers