Live briefing
Everything about Count-distinct problem
Problem in computer science
In computer science, the count-distinct problem (also known in applied mathematics as the cardinality estimation problem) is the problem of finding the number of distinct elements in a data stream with repeated elements. This is a well-known problem with numerous applications. The elements might represent IP addresses of packets passing through a router, unique visitors to a web site, elements in a large database, motifs in a DNA sequence, or elements of RFID/sensor networks. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Count-distinct problemA 5-minute orientation
- Pick up a classic book: American FilmThe most-reprinted book on the subject
- Go sideways: HyperLogLogA closely related topic
- Go sideways: Count–min sketchA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
- No matching papers found.
đź“š Books worth reading
American FilmAmerican Film Institute · 1975
Cartesian meditationsEdmund Husserl, Dorion Cairns · 1960
Just the argumentsMichael Bruce, Steven Barbone · 2011
The Conspirators HierarchyJohn Coleman · 1992
Treaty Occupationay ToxicologySuelen Queiroz · 2010
Fundamentals of data structures in CEllis Horowitz · 1993
Qualitative Data AnalysisMatthew B. Miles, A. Michael Huberman · 2013
Extremal CombinatoricsStasys Jukna · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- HyperLogLog HyperLogLog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset. Calculating the exact cardinality…
- Count–min sketch In computing, the count–min sketch (CM sketch) is a probabilistic data structure that serves as a frequency table of events in a stream of data. It uses…
- MinHash In computer science and data mining, MinHash (or the min-wise independent permutations locality-sensitive hashing scheme) is a technique for quickly estimating…
- Streaming algorithm In computer science, streaming algorithms process input data streams as a sequence of items, typically making just one pass (or a few passes) through the…
- Elementary symmetric polynomial In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials…
- Order statistic In statistics, the kth order statistic of a statistical sample is equal to its kth-smallest value. Given a sample of size n, the kth order statistic is…
- Sliding mode control In control systems, sliding mode control (SMC) is a nonlinear control method that alters the dynamics of a nonlinear system by applying a discontinuous…
- Harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is sometimes used for ratios and rates such as speeds, and is…