While these concepts overlap to some extent, each has distinct uses and properties. (1994)]įingerprint functions are related to (and sometimes confused with) checksums, hash functions, cryptographic hash functions, and digital signatures. Proceedings of the USENIX Winter Technical Conf. Manber, Finding Similar Files in a Large File System. Broder, Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol, IEEE/ACM Transactions on Networking, vol. Brin et al., "Copy Detection Mechanisms for Digital Documents," Proceedings of the ACM SIGMOD Annual Conference, San Jose 1995 (May 1995)] L. Broder, "On the Resemblance and Containment of Documents," Proceedings of Compression and Complexity of Sequences 1997, pp.
US Patent 6658423 Issued on December 2 2003] A. For instance, a web browser or proxy server can efficiently check whether a remote file has been modified, by fetching only its fingerprint and comparing it with that of the previously fetched copy Detecting duplicate and near-duplicate files. įingerprints are typically used to avoid the comparison and transmission of bulky data.
In Sequences II: Methods in Communications, Security, and Computer Science, pages 143-152.
Some applications of Rabin's fingerprinting method. In computer science, a fingerprinting algorithm is a procedure that maps an arbitrarily large data item (such as a computer file) to a much shorter bit string, its fingerprint, that uniquely identifies the original data for all practical purposes A.
0 kommentar(er)
