Abstract: In this paper, a new algorithm estimating the number of active flows in a data stream is proposed. This algorithm adapts the HyperLogLog algorithm of Flajolet et al. to data stream ...
Abstract: Data sketches are a set of widely used approximated data summarizing techniques. Their fundamental property is sub-linear memory complexity on the input cardinality, an important aspect when ...
zorkian/lca2015 - linux.conf.au 2015 tutorial on Building Services in Go buger/goterm - Advanced terminal output in Go albrow/zoom - A blazing-fast datastore and querying engine for Go built on Redis.
HyperLogLog Locality-Sensitive Hashing van Emde Boas Trees Augmented Data Structures Balanced search trees AVL trees Splay trees Red/black trees 2-3 search trees 2-3-4 Trees (aka 2-4 trees) N-ary ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback