Processing data Stream join aggregates using skimmed sketches

There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amount of memory. In this paper, we present the skimmed-sketch algorithm for estimating the join size of two streams.