The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
Open accessAbstract
This extended abstract describes and analyses a near-optimal probabilistic algorithm, HYPERLOGLOG, dedicated to estimating the number of \emphdistinct elements (the cardinality) of very large data ensembles. Using an auxiliary memory of m units (typically, "short bytes''), HYPERLOGLOG performs a single pass over the data and produces an estimate of the cardinality such that the relative accuracy (the standard error) is typically about $1.04/\sqrt{m}$. This improves on the best previously known cardinality estimator, LOGLOG, whose accuracy can be matched by consuming only 64% of the original memory. For instance, the new algorithm makes it possible to estimate cardinalities well beyond $10^9$ with a typical accuracy of 2% while using a memory of only 1.5 kilobytes. The algorithm parallelizes optimally and adapts to the sliding window model.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Knuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
On the resemblance and containment of documents
Broder, A. Z. (2002) · Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171) · doi:10.1109/sequen.1997.666900 · Cited by 1,698
Asymptotic methods in analysis
de Bruijn, N. G. (1958) · International Linear Collider · Cited by 1,332
Probabilistic counting algorithms for data base applications
Flajolet, P., & Nigel Martin, G. (1985) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(85)90041-8 · Cited by 1,269
Self-citationThe Space Complexity of Approximating the Frequency Moments
Alon, N., Matias, Y., & Szegedy, M. (1999) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1545 · Cited by 1,140
Maintaining Stream Statistics over Sliding Windows
Datar, M., Gionis, A., Indyk, P., & Motwani, R. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539701398363 · Cited by 835
Average Case Analysis of Algorithms on Sequences
Szpankowski, W. (2001) · Wiley eBooks · doi:10.1002/9781118032770 · Cited by 482
Counting Distinct Elements in a Data Stream
Bar-Yossef, Z., Jayram, T. S., Kumar, R., Sivakumar, D., & Trevisan, L. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45726-7_1 · Cited by 460
Cited by
Smart Cities: A Survey on Data Management, Security, and Enabling Technologies
Gharaibeh, A., Salahuddin, M. A., Hussini, S. J., Khreishah, A., Khalil, I., Guizani, M., & Al-Fuqaha, A. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2736886 · Cited by 628
Backstrom, L., Boldi, P., Rosa, M., Ugander, J., & Vigna, S. (2012) · Proceedings of the 4th Annual ACM Web Science Conference · doi:10.1145/2380718.2380723 · Cited by 567
KrakenUniq: confident and fast metagenomics classification using unique k-mer counts
Breitwieser, F. P., Baker, D. N., & Salzberg, S. L. (2018) · Genome Biology · doi:10.1186/s13059-018-1568-0 · Cited by 474
The khmer software package: enabling efficient nucleotide sequence analysis
Crusoe, M. R., Alameldin, H. F., Awad, S., Boucher, E., Caldwell, A., Cartwright, R., Charbonneau, A., Constantinides, B., Edvenson, G., Fay, S., et al. (2015) · F1000Research · doi:10.12688/f1000research.6924.1 · Cited by 388
TFX: A TensorFlow-Based Production-Scale Machine Learning Platform
Baylor, D., Breck, E., Cheng, H.-T., Fiedel, N., Foo, C. Y., Haque, Z., Haykal, S., Ispir, M., Jain, V., Koc, L., et al. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098021 · Cited by 350
Information network or social network?: the structure of the twitter follow graph
Myers, S. A., Sharma, A., Gupta, P., & Lin, J. (2014) · Proceedings of the 23rd International Conference on World Wide Web · doi:10.1145/2567948.2576939 · Cited by 313
Heule, S., Nunkesser, M., & Hall, A. (2013) · Proceedings of the 16th International Conference on Extending Database Technology · doi:10.1145/2452376.2452456 · Cited by 302
The Effect of Recommendations on Network Structure
Su, J., Sharma, A., & Goel, S. (2016) · Proceedings of the 25th International Conference on World Wide Web · doi:10.1145/2872427.2883040 · Cited by 78
KHyperLogLog: Estimating Reidentifiability and Joinability of Large Data at Scale
Chia, P. H., Desfontaines, D., Perera, I. M., Simmons-Marengo, D., Li, C., Day, W.-Y., Wang, Q., & Guevara, M. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00046 · Cited by 15
Metadata
- Authors
- Flajolet, P., Fusy, É., Gandouet, O., & Meunier, F.
- Venue
- Discrete Mathematics & Theoretical Computer Science
- Published
- 2007-01-01
- Volume
- DMTCS Proceedings vol. AH,...
- Issue
- Proceedings
- ISSN
- 1365-8050 (ISSN-L)
- OpenAlex
- W2144982963
- Cited by
- 695
- References
- 12
- FWCI
- 8.61
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
