{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T22:23:14Z","timestamp":1781130194051,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2452376.2452456","type":"proceedings-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T14:14:26Z","timestamp":1364220866000},"page":"683-692","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":246,"title":["HyperLogLog in practice"],"prefix":"10.1145","author":[{"given":"Stefan","family":"Heule","sequence":"first","affiliation":[{"name":"ETH Zurich and Google, Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Nunkesser","sequence":"additional","affiliation":[{"name":"Google, Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Hall","sequence":"additional","affiliation":[{"name":"Google, Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1317331.1317335"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646978.711822"},{"key":"e_1_3_2_1_3_1","first-page":"1","volume-title":"Scandinavian Journal of Statistics","author":"Clifford P.","year":"2011","unstructured":"P. Clifford and I. A. Cosma . A statistical analysis of probabilistic counting algorithms . Scandinavian Journal of Statistics , pages 1 -- 14 , 2011 . P. Clifford and I. A. Cosma. A statistical analysis of probabilistic counting algorithms. Scandinavian Journal of Statistics, pages 1--14, 2011."},{"key":"e_1_3_2_1_4_1","first-page":"605","volume-title":"European Symposium on Algorithms (ESA)","volume":"2832","author":"Durand M.","year":"2003","unstructured":"M. Durand and P. Flajolet . Loglog counting of large cardinalities. In G. D. Battista and U. Zwick, editors , European Symposium on Algorithms (ESA) , volume 2832 , pages 605 -- 617 , 2003 . M. Durand and P. Flajolet. Loglog counting of large cardinalities. In G. D. Battista and U. Zwick, editors, European Symposium on Algorithms (ESA), volume 2832, pages 605--617, 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.882836"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_3_2_1_7_1","first-page":"127","volume-title":"Analysis of Algorithms (AOFA)","author":"Flajolet P.","year":"2007","unstructured":"P. Flajolet , \u00c9ric Fusy , O. Gandouet , and F. Meunier . Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm . In Analysis of Algorithms (AOFA) , pages 127 -- 146 , 2007 . P. Flajolet, \u00c9ric Fusy, O. Gandouet, and F. Meunier. Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm. In Analysis of Algorithms (AOFA), pages 127--146, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.020"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350259"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946312"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807094"},{"key":"e_1_3_2_1_12_1","first-page":"489","volume-title":"Analysis of Algorithms (AOFA)","author":"Lumbroso J.","year":"2010","unstructured":"J. Lumbroso . An optimal cardinality estimation algorithm based on order statistics and its full analysis . In Analysis of Algorithms (AOFA) , pages 489 -- 504 , 2010 . J. Lumbroso. An optimal cardinality estimation algorithm based on order statistics and its full analysis. In Analysis of Algorithms (AOFA), pages 489--504, 2010."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920886"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353418"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1155\/2005\/962135"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","location":"Genoa Italy","acronym":"EDBT\/ICDT '13"},"container-title":["Proceedings of the 16th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2452376.2452456","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2452376.2452456","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:25Z","timestamp":1750234705000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2452376.2452456"}},"subtitle":["algorithmic engineering of a state of the art cardinality estimation algorithm"],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":16,"alternative-id":["10.1145\/2452376.2452456","10.1145\/2452376"],"URL":"https:\/\/doi.org\/10.1145\/2452376.2452456","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}