Optimal Bounds for Approximate Counting-Reference-Cited by-同舟云学术

Optimal Bounds for Approximate Counting

Published:2022-06-12 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
language:
Short-container-title:

Author:

Nelson Jelani¹,Yu Huacheng²

Affiliation:

1. UC Berkeley, Berkeley, DC, USA

2. Princeton University, Princeton, NJ, USA

Funder

NSF (National Science Foundation)

Office of Naval Research

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3517804.3526225

Reference15 articles.

1. Redis [n. d.]. Using Redis as an LRU cache. https://redis.io/topics/lru-cache. Last accessed Oct 22, 2020 .. Redis [n. d.]. Using Redis as an LRU cache. https://redis.io/topics/lru-cache. Last accessed Oct 22, 2020..

2. Mergeable summaries

3. Miklós Ajtai , T. S. Jayram , Ravi Kumar , and D. Sivakumar . 2002. Approximate counting of inversions in a data stream . In Proceedings on 34th Annual ACM Symposium on Theory of Computing (STOC). 370--379 . Miklós Ajtai, T. S. Jayram, Ravi Kumar, and D. Sivakumar. 2002. Approximate counting of inversions in a data stream. In Proceedings on 34th Annual ACM Symposium on Theory of Computing (STOC). 370--379.

4. The Space Complexity of Approximating the Frequency Moments

5. An Optimal Algorithm for ℓ 1 -Heavy Hitters in Insertion Streams and Related Problems

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Information Complexity Measure for Multi-pass Streaming with Applications;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Applications of Sketching and Pathways to Impact;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18