On 4/14/07, David Andersen <[EMAIL PROTECTED]> wrote:
Apr 14, 2007, at 12:15 PM, David Barrett wrote:
The reason it's called Rabin fingerprinting is that Rabin developed a
hash function that you can compute very efficiently in a sliding-
window manner (you shift the new byte in and the old byte out).
I *think* that this use first showed up in the LBFS (Low Bandwidth
File System) paper:
http://pdos.csail.mit.edu/papers/lbfs:sosp01/
I think, Manber had used this idea a lot earlier.
U. Manber. Finding similar files in a large file system. In Proc. of
the USENIX Winter Technical Conf., 1994.
--
Regards
~Ravi
_______________________________________________
p2p-hackers mailing list
[EMAIL PROTECTED]
http://lists.zooko.com/mailman/listinfo/p2p-hackers
