Probabilistic Data Structure

Revision as of 00:01, 23 September 2021 by Gmelli (talk | contribs) (Text replacement - ". ----" to ". ----")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

A Probabilistic Data Structure is a data structure that ...

Example(s):
- Bloom Filter.
- Locality-Sensitive Hash Function.
- Count–Min Sketch.
- MinHash.
- Quotient Filter.
- Random Binary Tree.
- Skip List.
- …
Counter-Example(s):
- a Deterministic Data Structure.
See: Randomized Algorithm, Hash-Table.

References

http://wikipedia.org/wiki/Category:Probabilistic_data_structures

Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Probabilistic_Data_Structure&oldid=720986"