On Sketching Trimmed Statistics

Summary: First sublinear-space study of trimmed frequency-vector statistics, including top-k and trimmed-vector F_p moments. Establishes a sharp sublinearity threshold via a_k²/(||x_-k||₂²/k), extends results beyond p≤2, and improves h-index sketches. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID: 2037
Venue: PODS
Year: 2026
Pagerank: 5.093636e-05
Overall Rank: 10,162 | 30.28%
DOI: 10.1145/3801907

Incoming Non-self Citations Over Time

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

Authors

1. Honghao Lin (Carnegie Mellon University)
2. Hoai-An Nguyen (Carnegie Mellon University)
3. David P. Woodruff (Carnegie Mellon University)

BibTeX Citation

@inproceedings{lin_pods26,
        address = {New York, NY, USA},
        series = {{PODS} '26},
        title = {{On Sketching Trimmed Statistics}},
        url = {https://dl.acm.org/doi/10.1145/3801907},
        doi = {10.1145/3801907},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Lin, Honghao and Nguyen, Hoai-An and Woodruff, David P.},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
482	An Optimal Algorithm for the Distinct Elements Problem	2010	PODS	0.00017772185
777	Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems	2011	PODS	0.0001410593
1,416	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB	0.00010839488
3,919	Optimal Bounds for Approximate Counting	2022	PODS	7.0176745e-05
6,275	BPTree: an ℓ2 Heavy Hitters Algorithm Using Constant Memory	2017	PODS	5.9299343e-05
6,454	An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems	2016	PODS	5.8746921e-05
8,252	Sampling Methods for Inner Product Sketching	2024	VLDB	5.4574671e-05
8,267	Streaming Algorithms for Measuring H-Impact	2017	PODS	5.4574671e-05
10,171	Unbiased Insights: Optimal Streaming Algorithms for l_p Sampling, the Forget Model, and Beyond	2026	PODS	5.093636e-05
10,646	Perfect Sampling in Turnstile Streams Beyond Small Moments	2025	PODS	5.093636e-05
11,125	Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut	2024	PODS	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,305	Space-Efficient Estimation of Statistics over Sub-Sampled Streams	2012	PODS
2	1,600	Space-optimal Heavy Hitters with Strong Error Bounds	2009	PODS
3	11,196	A Universal Sketch for Estimating Heavy Hitters and Per-Element Frequency Moments in Data Streams with Bounded Deletions	2024	SIGMOD
4	8,106	SpaceSaving±: An Optimal Algorithm for Frequency Estimation and Frequent Items in the Bounded-Deletion Model	2022	VLDB
5	10,651	Robust Statistical Analysis on Streaming Data with Near-Duplicates in General Metric Spaces	2025	PODS
6	10,171	Unbiased Insights: Optimal Streaming Algorithms for l_p Sampling, the Forget Model, and Beyond	2026	PODS
7	7,091	Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald	2024	PODS
8	10,168	Tight Lower Bounds for l2 Sampling	2026	PODS
9	3,481	Tighter Estimation using Bottom k Sketches	2008	VLDB
10	7,918	Subspace Exploration: Bounds on Projected Frequency Estimation	2021	PODS