HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm

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 sin...

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй

Үндсэн зохиолчид:	Philippe Flajolet, Éric Fusy, Olivier Gandouet, Frédéric Meunier
Формат:	Artigo
Хэл сонгох:	Inglês
Хэвлэсэн:	Discrete Mathematics & Theoretical Computer Science 2007-01-01
Цуврал:	Discrete Mathematics & Theoretical Computer Science
Нөхцлүүд:	cardinality estimation probabilistic algorithm [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-cg] computer science [cs]/computational geometry [cs.cg]
Онлайн хандалт:	https://dmtcs.episciences.org/3545/pdf
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!