Bit-array-based alternatives to HyperLogLog

DOI10.4230/LIPICS.AOFA.2024.5MaRDI QIDQ6865694zbMATH OpenFDO

Authors Svante Janson, Jérémie Lumbroso, Robert Sedgewick

Publication date 30 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.AOFA.2024.5

zbMATH Keywords

sketchingcardinality estimationHyperLogLog

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites work

• scientific article; zbMATH DE number 6351507 (Why is no real title available?)
• scientific article; zbMATH DE number 5763313 (Why is no real title available?)
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• scientific article; zbMATH DE number 1256715 (Why is no real title available?)
• Affirmative sampling: theory and applications
• An optimal cardinality estimation algorithm based on order statistics and its full analysis
• Information theoretic limits of cardinality estimation: Fisher meets Shannon
• LogLog counting of large cardinalities (extended abstract)
• Probabilistic counting algorithms for data base applications
• Probability: a graduate course

Cited in

(1)

• Bit-array-based alternatives to HyperLogLog

This page was built for publication: Bit-array-based alternatives to HyperLogLog

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6865694)