tomaka

// Suppose you have a variable named `future` which implements the `Future` trait.
let future: impl Future = ...;

// This gist demonstrates how to run the future until completion using the `stdweb` crate.


// The various imports.

extern crate futures;
extern crate stdweb;

MartinBodocky

// Creating new threads
open System
open System.Threading

//What will execute on each thread
let threadBody() = 
    for i in 1..5 do
        //Wait 1/10 of a second
        Thread.Sleep(100)
        printfn "[Thread %d] %d ..."

debasishg

General Background and Overview

1. Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
2. Models and Issues in Data Stream Systems
3. Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
4. Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
5. [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep=rep1&t