3 ms·
I am working on a benchmarking blog post where I will be comparing count-min, count-mean-min, count-min-log and psc... Its very nice to see how much space is be
by seiflotfy 11y ago
I am working on a benchmarking blog post where I will be comparing count-min, count-mean-min, count-min-log and psc...
Its very nice to see how much space is being saved sadly estimating is a bit expensive (yet doable). I plan to also do some minor optimisation to the code before the benchmarking. I find it very sad that no one implemented it publicly. AFAICT this is the only implementation around.
- seiflotfy 11y agovoila. my first benchmarks based on my use case https://news.ycombinator.com/item?id=10149522 https://news.ycombinator.com/item?id=10149522
- versteegen 11y agoThanks, interesting. I replied in the comments there.
- seiflotfy 11y agoWith zipf distribution did you mean for every flow insert a zipf fetched number of events?
- versteegen 11y agoYou mean whether to decide the number of events randomly? You could certainly do that, whether you do that or use the "ideal" distribution without sampling noise just effects how much noise you get in the computed/actual graph. But maybe the order in which you add the events to these sketches affects the results? If so it might be bad to add X of flow Y before moving to the next flow.