Guillaume Pitel gave a talk at iSwag 2016 about our newest breakthrough algorithm for fast approximate counting. Our Count-Min-Tree sketch structure outperforms the state of the art methods by serveral orders of magnitude. See the presentation and the paper.
