{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:51:11Z","timestamp":1773481871717,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T00:00:00Z","timestamp":1660435200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["16582"],"award-info":[{"award-number":["16582"]}],"id":[{"id":"10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,14]]},"DOI":"10.1145\/3534678.3539246","type":"proceedings-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T19:06:41Z","timestamp":1660331201000},"page":"753-761","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["HyperLogLogLog"],"prefix":"10.1145","author":[{"given":"Matti","family":"Karppa","sequence":"first","affiliation":[{"name":"IT University of Copenhagen, Copenhagen, Denmark"}]},{"given":"Rasmus","family":"Pagh","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Copenhagen, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2380718.2380723"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45726-7_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1361192.1361194"},{"key":"e_1_3_2_1_4_1","article-title":"Optimal Streaming and Tracking Distinct Elements with High Probability","volume":"16","author":"Jaros\u0142","year":"2020","unstructured":"Jaros\u0142 aw B\u0142 asiok. 2020. Optimal Streaming and Tracking Distinct Elements with High Probability. ACM Trans. Algorithms , Vol. 16, 1 (2020), 3:1--3:28.","journal-title":"ACM Trans. Algorithms"},{"key":"e_1_3_2_1_5_1","volume-title":"Salzberg","author":"Breitwieser Florian P.","year":"2018","unstructured":"Florian P. Breitwieser, Daniel N. Baker, and Steven L. Salzberg. 2018. Kraken\u00adUniq: confident and fast metagenomics classification using unique k-mer counts. Genome Biology , Vol. 19, 198 (2018)."},{"key":"e_1_3_2_1_6_1","volume-title":"Dubhashi and Alessandro Panconesi","author":"Devdatt","year":"2009","unstructured":"Devdatt P. Dubhashi and Alessandro Panconesi. 2009. Concentration of Measure for the Analysis of Randomized Algorithms .Cambridge University Press."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_55"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.3545"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.020"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2903730"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452456"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. PODS 2010 . 41--52","author":"Kane Daniel M.","unstructured":"Daniel M. Kane, Jelani Nelson, and David P. Woodruff. 2010. An optimal algorithm for the distinct elements problem. In Proc. PODS 2010 . 41--52."},{"key":"e_1_3_2_1_14_1","volume-title":"The Art of Computer Programming","author":"Knuth Donald E.","unstructured":"Donald E. Knuth. 1998. The Art of Computer Programming. Volume 3. Sorting and Searching .Addison-Wesley."},{"key":"e_1_3_2_1_15_1","volume-title":"Back to the Future: an Even More Nearly Optimal Cardinality Estimation Algorithm. CoRR","author":"Lang Kevin J.","year":"2017","unstructured":"Kevin J. Lang. 2017. Back to the Future: an Even More Nearly Optimal Cardinality Estimation Algorithm. CoRR , Vol. abs\/1708.06839 (2017). showeprint[arXiv]1708.06839"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2015.2423675"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369909"},{"key":"e_1_3_2_1_18_1","volume-title":"Paterson and Mathilde Raynal","author":"Kenneth","year":"2021","unstructured":"Kenneth G. Paterson and Mathilde Raynal. 2021. HyperLogLog: Exponentially Bad in Adversarial Settings. IACR Cryptol. ePrint Arch. (2021), 1139."},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. ICALP 2021","volume":"198","author":"Pettie Seth","year":"2021","unstructured":"Seth Pettie, Dingyu Wang, and Longhui Yin. 2021. Non-Mergeable Sketching for Cardinality Estimation. In Proc. ICALP 2021 , Vol. 198. 104:1--104:20."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2970860"}],"event":{"name":"KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Washington DC USA","acronym":"KDD '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534678.3539246","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3534678.3539246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:59:58Z","timestamp":1750186798000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534678.3539246"}},"subtitle":["Cardinality Estimation With One Log More"],"short-title":[],"issued":{"date-parts":[[2022,8,14]]},"references-count":21,"alternative-id":["10.1145\/3534678.3539246","10.1145\/3534678"],"URL":"https:\/\/doi.org\/10.1145\/3534678.3539246","relation":{},"subject":[],"published":{"date-parts":[[2022,8,14]]},"assertion":[{"value":"2022-08-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}