DBScholar

Back to papers

Tight Lower Bounds for l2 Sampling

Summary: Proves an Ω(log² n) sketching-dimension lower bound for ℓ₂-sampling, separating p=2 from 0<p<2 and matching the best upper bound. Establishes Ω(ε⁻²log n) for probability estimation and extends optimality to integer turnstile streams. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
2045
Venue
PODS
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,168 | 30.24%
DOI
10.1145/3801915

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{swartworth_pods26,
        address = {New York, NY, USA},
        series = {{PODS} '26},
        title = {{Tight Lower Bounds for l2 Sampling}},
        url = {https://dl.acm.org/doi/10.1145/3801915},
        doi = {10.1145/3801915},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Swartworth, William and Woodruff, David P.},
        year = {2026}
}

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 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
777 Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems 2011 PODS 0.0001410593
10,646 Perfect Sampling in Turnstile Streams Beyond Small Moments 2025 PODS 5.093636e-05
Previous Page 1 / 1 Next

Semantically Similar Papers