New Cardinality Estimation Methods for HyperLogLog Sketches

A Linear-Time Probabilistic Counting Algorithm for Database Applications

K.-Y. Whang, B. T. Vander-Zanden, and H. M. Taylor. 1990 · 1990

Earlier work this paper cites.

The Space Complexity of Approximating the Frequency Moments

N. Alon, Y. Matias, and M. Szegedy. 1999 · 1999

Earlier work this paper cites.

Statistical Inference

G. Casella and R. L. Berger. 2002 · 2002

Earlier work this paper cites.

Loglog Counting of Large Cardinalities. In Proc. of the 11th Annual European Symposium on Algorithms

M. Durand and P. Flajolet. 2003 · 2003

Earlier work this paper cites.

Tight Lower Bounds for the Distinct Elements Problem. In Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science

P. Indyk and D. Woodruff. 2003 · 2003

Earlier work this paper cites.

On Synopses for Distinct-Value Estimation Under Multiset Operations. In Proc. of the 26th ACM SIGMOD International Conference on Management of Data

K. Beyer, P. J. Haas, B. Reinwald, Y. Sismanis, and R. Gemulla. 2007 · 2007

Earlier work this paper cites.

Summarizing Data Using Bottom-k Sketches. In Proc. of the 26th Annual ACM Symposium on Principles of Distributed Computing

E. Cohen and H. Kaplan. 2007 · 2007

Earlier work this paper cites.

Hyperloglog: The Analysis of a Near-Optimal Cardinality Estimation Algorithm. In Proc. of the 13th Conference on Analysis of Algorithms

P. Flajolet, É. Fusy, O. Gandouet, and F. Meunier. 2007 · 2007

Earlier work this paper cites.

Numerical Recipes: The Art of Scientific Computing

W. H. Press. 2007 · 2007

Earlier work this paper cites.

Why Go Logarithmic If We Can Go Linear?: Towards Effective Distinct Counting of Search Traffic. In Proc. of the 11th International Conference on Extending Database Technology

A. Metwally, D. Agrawal, and A. E. Abbadi. 2008 · 2008

Cited alongside, same era.

Dlib-ml: A Machine Learning Toolkit

D. E. King. 2009 · 2009

Cited alongside, same era.

An Optimal Algorithm for the Distinct Elements Problem. In Proc. of the 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems

D. M. Kane, J. Nelson, and D. P. Woodruff. 2010 · 2010

Cited alongside, same era.

Distinct Counting with a Self-Learning Bitmap

A. Chen, J. Cao, L. Shepp, and T. Nguyen. 2011 · 2011

Cited alongside, same era.

Theory and Applications of b-bit Minwise Hashing

P. Li and A. C. König. 2011 · 2011

Cited alongside, same era.

Streamed Approximate Counting of Distinct Elements: Beating Optimal Batch Methods. In Proc. of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

D. Ting. 2014 · 2014

Later among the works it cites.

Hashing for Similarity Search: A Survey

Original

J. Wang, H. T. Shen, J. Song, and J. Ji. 2014 · 2014

Later among the works it cites.

All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis

E. Cohen. 2015 · 2015

Later among the works it cites.

A Framework for Estimating Stream Expression Cardinalities

Original

A. Dasgupta, K. Lang, L. Rhodes, and J. Thaler. 2015 · 2015

Later among the works it cites.

System and Method for Enhanced Accuracy Cardinality Estimation

L. Rhodes. 2015 · 2015

Later among the works it cites.