HyperLogLogLog-Reference-Cited by-同舟云学术

HyperLogLogLog

Published:2022-08-14 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Karppa Matti¹,Pagh Rasmus²

Affiliation:

1. IT University of Copenhagen, Copenhagen, Denmark

2. University of Copenhagen, Copenhagen, Denmark

Funder

Villum Fonden

Publisher

ACM

Link

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

Reference21 articles.

1. Four degrees of separation

2. Counting Distinct Elements in a Data Stream

3. Compact dictionaries for variable-length keys and data with applications

4. Optimal Streaming and Tracking Distinct Elements with High Probability;Jarosł;ACM Trans. Algorithms,2020

5. Florian P. Breitwieser , Daniel N. Baker , and Steven L . Salzberg . 2018 . KrakenUniq: confident and fast metagenomics classification using unique k-mer counts. Genome Biology , Vol. 19 , 198 (2018). Florian P. Breitwieser, Daniel N. Baker, and Steven L. Salzberg. 2018. KrakenUniq: confident and fast metagenomics classification using unique k-mer counts. Genome Biology , Vol. 19, 198 (2018).

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

1. CardSketch: Shift Attention for Network-wide Cardinality Telemetry;2024 IEEE 49th Conference on Local Computer Networks (LCN);2024-10-08

2. QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

3. GSearch: ultra-fast and scalable genome search by combining K-mer hashing with hierarchical navigable small world graphs;Nucleic Acids Research;2024-07-16

4. Half-Xor: A Fully-Dynamic Sketch for Estimating the Number of Distinct Values in Big Tables;IEEE Transactions on Knowledge and Data Engineering;2024-07

5. A Revisit to Graph Neighborhood Cardinality Estimation;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13