作者: Ely Porat , Ohad Lipsky
DOI: 10.1007/978-3-540-73437-6_19
关键词:
摘要: We address the problemof sketching hamming distance of data streams. develop Fixable Sketches which compare streams or files and restore differences between them. Our contribution: For two with bounded by k we show a sketch size O(k log n) O(log processing time per new element in stream how to all locations where differ linear size. Probability error is less than 1/n.