This PR provides exact PMF's (when the memory cost of the PMF is expected to be low) and approximate PMF's (when memory cost is high, but the majority of the PMF's mass is found within a small number of elements of the stream). It includes a minimal Count-Min Sketch implementation, which is used to derive approximate PMF's.
This PR provides exact PMF's (when the memory cost of the PMF is expected to be low) and approximate PMF's (when memory cost is high, but the majority of the PMF's mass is found within a small number of elements of the stream). It includes a minimal Count-Min Sketch implementation, which is used to derive approximate PMF's.