Hi people, in this post I’ll present part of my master degree field study: probabilistic data structures or just sketches. The latest post I describe what sketches means if you’re missed. Count-min 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 hash functions to map events to frequencies, but unlike a hash table uses only sub-linear space, at the expense of overcounting some events due to collisions.
Hi people, in this post I’ll present part of my master degree field study: probabilistic data structures or just sketches. Introduction to sketches Every programmer well know data structures like List, Stack, Trees and others. This type of data strucutures are called abstract data structures becouse them can store any kind of information and solve many kind of problems in general. Sketches comes to solve special needs where time and space for computing is very restrict for amount of data that you must deal.