Update Procedure: When a new word pair "x" with count c arrives, one counter in each row (as decided by its corresponding hash function) is updated by c. Query Procedure: Since multiple word pairs can get hashed to the same position, the frequency stored by each position is guaranteed to overestimate the true count.
to answer the point query for a given word pair, we return minimum over all the positions indexed by the k hash functions.