fabiofumarola
An interesting thing is that you can find some of these concepts implemented in apache spark (count approx) and into BlinkDB. While, from a theoretical point of view many result are relate d to statistical bound like Chernoff bound and Chebyshev inequality. During my phd I found this topic interesting and promising to answer to mine data with a verified error bound for precision/recall and elapsed time.
To go deeply into this topic I suggest the book Knowledge Discovery from Data Streams http://www.liaad.up.pt/area/jgama/DataStreamsCRC.pdf and other books written by Joao Gama.
An initial evaluation of Confluent Platform
Exposing Docker containers via NGINX
On comparing Swift runtime performances
Since swift is released as open source it would be interesting to compare swift performances. I found the interesting project http://github.com/andreaferretti/kmeans that compares the execution time of the KMeans algorithm on several languages.From the results it looks like that the execution time is comparable to python and it is pretty distant from the...