Improved Sketching of Hamming Distance with Error Correcting

We address the problem of sketching the hamming distance of data streams. We present a new notion of sketching technique, Fixable sketches and we show that using such sketch not only we reduce the sketch size, but also restore the differences between the streams. Our contribution: For two streams with hamming distance bounded by k we show a sketch of size O(k log n) with O(log n) processing time per new element in the stream and how to restore all locations where the two streams differ in time linear in the sketch size. Probability of error is less than 1/n.

• Type: Conference
• Year: 2007
• Where: CPM
• Authors: Ely Porat, Ohad Lipsky
• Keywords: CPM 2007, Data Streams, Hamming Distance, Sketch Size