A Class of Randomized Strategies for Low-Cost Comparison of File Copies

Authors:
D. Barbará;R. J. Lipton
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1991

Citing 0
Cited 12

Efficient detection of corrupted pages in a replicated file

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Sleepers and workaholics: caching strategies in mobile environments

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Communication complexity of document exchange

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient Location of Discrepancies in Multiple Replicated Large Files

IEEE Transactions on Parallel and Distributed Systems
Sleepers and workaholics: caching strategies in mobile environments (extended version)

The VLDB Journal — The International Journal on Very Large Data Bases
An Optimal Strategy for Comparing File Copies

IEEE Transactions on Parallel and Distributed Systems
Using Checksums to Detect Data Corruption

EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
A checksum-based corruption detection technique

Journal of Computer Security - IFIP 2000
Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Algebraic Signatures for Scalable Distributed Data Structures

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient detection of discrepancies in multiple file copies

Distributed Computing
Increasing software reliability using a signature method

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class of algorithms that use randomized signatures to compare remotely located filecopies is presented. A simple technique that sends on the order of 4/sup f/log(n) bits,where f is the number of differing pages that are to be diagnosed and n is the number ofpages in the file, is described. A method to improve the bound in the number of bits sent,making them grow with f as flog(f) and with n as log(n)log(log(n)), and a class ofalgorithms in which the number of signatures grows with f as fr/sup f/, where r can bemade to approach 1, are also presented. A comparison of these techniques is discussed.