So here is where we get a new concept called, means gets so counting sketches this

the extension of the original in a sketch model we saw lately nested morally so that we
could keep in his short succinct and a frequency is half the occurrences of the numbers
and we could generate metrics ( la di average et cetera here we model line bought the
stream as an actor a of commission and and there we can create a small summary as
an array of size smaller W by de and there we have were a set of hash functions which
map the director original vector a two point W so the idea is W Times D is a small
summary of the original A times in the way we compute the entry a sale bag there we try
to look at Kate entry in the tool date throw of the summary is the sum of frequency of all
items I which are mapped by that date has functioned to value K so if you take the you
know date row Kate into the aid is basically the sum of all the in our increase where its
stake will do each day of eye means the hash function that responding to draw the so
as he saw here we use the hash functions one for each of so we actually have were W
columns and safe TA is the role its day is the corresponding hash function we find those
MPs for a tech DFI quilt K and week's some the frequency of all of that and that
becomes the value in CD of K so in effect what we're saying is in that date row Kate
Kaul am in the A's frequency of all items I such that its day off I is equal to get to this is
something like we are counting the frequency of all items which are effect we've
mapped to the value K idea is basically based on locality sensitive hashing victory
discussed the card to business sales like a cryptic summary of the overall original input
so what happens when you want to update an item I we look at all their knee functions
and their Wii look at its day of eye and a compute and update to enter the CD of its day
of eye for all the day gross example here we find that the sea one representing in count
of see and add it to the fourth entry because its day of high equal to 410 to hear the
idea here is that whenever we are updating an entry I we had to update all the entries
corresponding to all that the hash functions is not likely competing only one hash
function to the scattering is updated at the different places whenever we have an update
to the item I so agree found here is a cryptic approach to summarising the hash table of
the original data it's effectively you can say it is like histogram of the original data where
your keeping an notion of number of times a particular data is being given as output this
is a useful for aggregate queries and we can also use it for range queries like if you
want to find out the number of entries between one and ex similarly percentile very can
be obtained by repeated range queries where binary search through values of X and
~done count of the range query is right so in the previous cases count and if you see
that count can be repeated till we see in account close to 1/4 of the total count we can
say that it's quite asked what similarly fit a county is a fun half then we can create the
median to the idea in their count means gets A's that we need to map a empty as
collection of the different hash functions and every time an update happens all the hash
functions need to be updated and there this news a idea of something like the histogram
of the data where each data is represented by many times it is occurring levels it sat on
it is also briefly known as the counting version of the popular Bloomfield and it is used in
streaming the counting sketches are very useful sketching got them far summarising the
data in IUD and a little data streams